./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046.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_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/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_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/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_fca21f10-8c52-49da-849f-88cabe32ae62/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 f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:48:46,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:48:46,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:48:46,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:48:46,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:48:46,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:48:46,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:48:46,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:48:46,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:48:46,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:48:46,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:48:46,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:48:46,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:48:46,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:48:46,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:48:46,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:48:46,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:48:46,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:48:46,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:48:46,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:48:46,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:48:46,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:48:46,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:48:46,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:48:46,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:48:46,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:48:46,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:48:46,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:48:46,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:48:46,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:48:46,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:48:46,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:48:46,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:48:46,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:48:46,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:48:46,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:48:46,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:48:46,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:48:46,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:48:46,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:48:46,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:48:46,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 20:48:46,973 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:48:46,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:48:46,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:48:46,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:48:46,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:48:46,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:48:46,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:48:46,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:48:46,976 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:48:46,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:48:46,976 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:48:46,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:48:46,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:48:46,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:48:46,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:48:46,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:48:46,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:48:46,977 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:48:46,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:48:46,978 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:48:46,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:48:46,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:48:46,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:48:46,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:48:46,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:48:46,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:48:46,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:48:46,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:48:46,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:48:46,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:48:46,979 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:48:46,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:48:46,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:48:46,980 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:48:46,980 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_fca21f10-8c52-49da-849f-88cabe32ae62/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_fca21f10-8c52-49da-849f-88cabe32ae62/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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2021-12-06 20:48:47,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:48:47,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:48:47,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:48:47,189 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:48:47,190 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:48:47,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/mix046.opt.i [2021-12-06 20:48:47,232 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/data/740e1defc/c098c72f4531456fb85f9ea761ae408e/FLAGada70e408 [2021-12-06 20:48:47,688 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:48:47,688 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2021-12-06 20:48:47,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/data/740e1defc/c098c72f4531456fb85f9ea761ae408e/FLAGada70e408 [2021-12-06 20:48:48,026 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/data/740e1defc/c098c72f4531456fb85f9ea761ae408e [2021-12-06 20:48:48,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:48:48,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:48:48,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:48:48,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:48:48,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:48:48,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44df1b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48, skipping insertion in model container [2021-12-06 20:48:48,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:48:48,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:48:48,176 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_fca21f10-8c52-49da-849f-88cabe32ae62/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2021-12-06 20:48:48,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:48:48,293 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:48:48,302 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_fca21f10-8c52-49da-849f-88cabe32ae62/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2021-12-06 20:48:48,340 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:48:48,367 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:48:48,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48 WrapperNode [2021-12-06 20:48:48,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:48:48,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:48:48,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:48:48,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:48:48,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,417 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2021-12-06 20:48:48,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:48:48,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:48:48,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:48:48,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:48:48,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:48:48,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:48:48,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:48:48,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:48:48,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (1/1) ... [2021-12-06 20:48:48,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:48:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:48:48,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:48:48,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:48:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 20:48:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 20:48:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:48:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 20:48:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 20:48:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 20:48:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 20:48:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 20:48:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 20:48:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 20:48:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 20:48:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-06 20:48:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-06 20:48:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:48:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 20:48:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:48:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:48:48,540 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 20:48:48,646 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:48:48,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:48:48,943 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:48:49,152 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:48:49,152 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 20:48:49,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:48:49 BoogieIcfgContainer [2021-12-06 20:48:49,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:48:49,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:48:49,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:48:49,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:48:49,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:48:48" (1/3) ... [2021-12-06 20:48:49,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7168c928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:48:49, skipping insertion in model container [2021-12-06 20:48:49,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:48" (2/3) ... [2021-12-06 20:48:49,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7168c928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:48:49, skipping insertion in model container [2021-12-06 20:48:49,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:48:49" (3/3) ... [2021-12-06 20:48:49,160 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2021-12-06 20:48:49,166 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 20:48:49,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:48:49,166 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 20:48:49,166 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 20:48:49,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,199 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,200 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,200 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,200 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,200 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,200 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,202 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,202 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,202 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,202 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,202 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,202 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,202 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,203 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,203 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,204 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,204 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,204 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,204 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,205 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,205 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,206 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,207 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,208 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,208 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,208 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,208 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,209 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,210 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,211 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,211 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,211 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,211 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,211 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,211 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,212 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,212 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,212 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,212 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,212 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,213 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,213 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,213 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,213 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,214 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,214 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,214 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,217 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,217 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,217 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,217 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,218 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,219 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,219 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,219 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,220 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,220 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,220 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,221 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,221 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,221 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,221 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,222 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,223 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,223 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,223 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,223 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 20:48:49,223 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 20:48:49,265 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:48:49,270 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 20:48:49,270 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-06 20:48:49,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2021-12-06 20:48:49,319 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2021-12-06 20:48:49,319 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 20:48:49,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2021-12-06 20:48:49,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2021-12-06 20:48:49,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2021-12-06 20:48:49,340 INFO L129 PetriNetUnfolder]: 0/91 cut-off events. [2021-12-06 20:48:49,340 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 20:48:49,341 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:49,341 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] [2021-12-06 20:48:49,342 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1364924999, now seen corresponding path program 1 times [2021-12-06 20:48:49,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002454673] [2021-12-06 20:48:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:49,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:49,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 20:48:49,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002454673] [2021-12-06 20:48:49,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002454673] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:49,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:49,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:48:49,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924834624] [2021-12-06 20:48:49,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:49,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:48:49,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:49,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:48:49,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:48:49,617 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2021-12-06 20:48:49,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:48:49,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:49,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2021-12-06 20:48:49,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:49,719 INFO L129 PetriNetUnfolder]: 17/277 cut-off events. [2021-12-06 20:48:49,719 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-12-06 20:48:49,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 277 events. 17/277 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 830 event pairs, 7 based on Foata normal form. 9/275 useless extension candidates. Maximal degree in co-relation 275. Up to 27 conditions per place. [2021-12-06 20:48:49,723 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2021-12-06 20:48:49,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 132 transitions, 302 flow [2021-12-06 20:48:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:48:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 20:48:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2021-12-06 20:48:49,735 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2021-12-06 20:48:49,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2021-12-06 20:48:49,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2021-12-06 20:48:49,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:49,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2021-12-06 20:48:49,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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 20:48:49,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 20:48:49,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 20:48:49,749 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2021-12-06 20:48:49,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 132 transitions, 302 flow [2021-12-06 20:48:49,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 20:48:49,756 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2021-12-06 20:48:49,758 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2021-12-06 20:48:49,761 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2021-12-06 20:48:49,761 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2021-12-06 20:48:49,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:48:49,761 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:49,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:49,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:48:49,762 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash -836884992, now seen corresponding path program 1 times [2021-12-06 20:48:49,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:49,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515239007] [2021-12-06 20:48:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:49,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:49,962 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 20:48:49,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:49,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515239007] [2021-12-06 20:48:49,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515239007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:49,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:49,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:48:49,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799193891] [2021-12-06 20:48:49,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:49,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:48:49,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:48:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:48:49,966 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2021-12-06 20:48:49,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 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 20:48:49,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:49,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2021-12-06 20:48:49,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:50,315 INFO L129 PetriNetUnfolder]: 357/1260 cut-off events. [2021-12-06 20:48:50,316 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2021-12-06 20:48:50,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 1260 events. 357/1260 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8927 event pairs, 59 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 1883. Up to 333 conditions per place. [2021-12-06 20:48:50,325 INFO L132 encePairwiseOnDemand]: 130/137 looper letters, 21 selfloop transitions, 3 changer transitions 50/172 dead transitions. [2021-12-06 20:48:50,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 172 transitions, 496 flow [2021-12-06 20:48:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:48:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 20:48:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1098 transitions. [2021-12-06 20:48:50,332 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2021-12-06 20:48:50,333 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1098 transitions. [2021-12-06 20:48:50,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1098 transitions. [2021-12-06 20:48:50,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:50,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1098 transitions. [2021-12-06 20:48:50,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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 20:48:50,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 20:48:50,346 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 20:48:50,346 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1098 transitions. [2021-12-06 20:48:50,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 172 transitions, 496 flow [2021-12-06 20:48:50,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 172 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 20:48:50,351 INFO L242 Difference]: Finished difference. Result has 153 places, 117 transitions, 281 flow [2021-12-06 20:48:50,352 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=153, PETRI_TRANSITIONS=117} [2021-12-06 20:48:50,353 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2021-12-06 20:48:50,353 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 117 transitions, 281 flow [2021-12-06 20:48:50,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 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 20:48:50,354 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:50,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:50,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:48:50,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash -283519073, now seen corresponding path program 1 times [2021-12-06 20:48:50,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:50,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937380643] [2021-12-06 20:48:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:50,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:50,490 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 20:48:50,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:50,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937380643] [2021-12-06 20:48:50,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937380643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:50,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:50,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:48:50,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151171854] [2021-12-06 20:48:50,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:50,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:48:50,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:50,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:48:50,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:48:50,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2021-12-06 20:48:50,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 117 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 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 20:48:50,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:50,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2021-12-06 20:48:50,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:50,731 INFO L129 PetriNetUnfolder]: 192/589 cut-off events. [2021-12-06 20:48:50,731 INFO L130 PetriNetUnfolder]: For 485/489 co-relation queries the response was YES. [2021-12-06 20:48:50,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 589 events. 192/589 cut-off events. For 485/489 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3078 event pairs, 49 based on Foata normal form. 20/576 useless extension candidates. Maximal degree in co-relation 1196. Up to 116 conditions per place. [2021-12-06 20:48:50,736 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 16 selfloop transitions, 2 changer transitions 22/141 dead transitions. [2021-12-06 20:48:50,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 141 transitions, 427 flow [2021-12-06 20:48:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:48:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 20:48:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2021-12-06 20:48:50,740 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2021-12-06 20:48:50,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2021-12-06 20:48:50,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2021-12-06 20:48:50,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:50,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2021-12-06 20:48:50,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 0 states have call successors, (0), 0 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 20:48:50,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 20:48:50,747 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 20:48:50,747 INFO L186 Difference]: Start difference. First operand has 153 places, 117 transitions, 281 flow. Second operand 9 states and 1086 transitions. [2021-12-06 20:48:50,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 141 transitions, 427 flow [2021-12-06 20:48:50,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 141 transitions, 410 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-06 20:48:50,753 INFO L242 Difference]: Finished difference. Result has 144 places, 117 transitions, 292 flow [2021-12-06 20:48:50,753 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=144, PETRI_TRANSITIONS=117} [2021-12-06 20:48:50,754 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2021-12-06 20:48:50,754 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 292 flow [2021-12-06 20:48:50,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 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 20:48:50,755 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:50,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:50,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:48:50,755 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:50,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1173317502, now seen corresponding path program 1 times [2021-12-06 20:48:50,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:50,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838633379] [2021-12-06 20:48:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:50,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:50,969 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 20:48:50,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:50,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838633379] [2021-12-06 20:48:50,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838633379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:50,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:50,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:48:50,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652442477] [2021-12-06 20:48:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:50,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:48:50,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:50,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:48:50,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:48:50,974 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-06 20:48:50,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 292 flow. Second operand has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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 20:48:50,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:50,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-06 20:48:50,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:51,272 INFO L129 PetriNetUnfolder]: 173/530 cut-off events. [2021-12-06 20:48:51,272 INFO L130 PetriNetUnfolder]: For 622/625 co-relation queries the response was YES. [2021-12-06 20:48:51,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 530 events. 173/530 cut-off events. For 622/625 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2613 event pairs, 69 based on Foata normal form. 14/518 useless extension candidates. Maximal degree in co-relation 1176. Up to 169 conditions per place. [2021-12-06 20:48:51,280 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 18 selfloop transitions, 10 changer transitions 22/146 dead transitions. [2021-12-06 20:48:51,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 146 transitions, 480 flow [2021-12-06 20:48:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 20:48:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 20:48:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1717 transitions. [2021-12-06 20:48:51,287 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8355231143552312 [2021-12-06 20:48:51,287 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1717 transitions. [2021-12-06 20:48:51,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1717 transitions. [2021-12-06 20:48:51,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:51,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1717 transitions. [2021-12-06 20:48:51,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.46666666666667) internal successors, (1717), 15 states have internal predecessors, (1717), 0 states have call successors, (0), 0 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 20:48:51,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 0 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 20:48:51,299 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 0 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 20:48:51,299 INFO L186 Difference]: Start difference. First operand has 144 places, 117 transitions, 292 flow. Second operand 15 states and 1717 transitions. [2021-12-06 20:48:51,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 146 transitions, 480 flow [2021-12-06 20:48:51,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 146 transitions, 448 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 20:48:51,304 INFO L242 Difference]: Finished difference. Result has 152 places, 121 transitions, 336 flow [2021-12-06 20:48:51,305 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=336, PETRI_PLACES=152, PETRI_TRANSITIONS=121} [2021-12-06 20:48:51,305 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 8 predicate places. [2021-12-06 20:48:51,306 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 121 transitions, 336 flow [2021-12-06 20:48:51,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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 20:48:51,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:51,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:51,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:48:51,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:51,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:51,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1514740634, now seen corresponding path program 1 times [2021-12-06 20:48:51,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:51,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513025659] [2021-12-06 20:48:51,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:51,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:51,515 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 20:48:51,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:51,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513025659] [2021-12-06 20:48:51,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513025659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:51,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:51,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 20:48:51,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450939689] [2021-12-06 20:48:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:51,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 20:48:51,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 20:48:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:48:51,519 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-06 20:48:51,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 121 transitions, 336 flow. Second operand has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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 20:48:51,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:51,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-06 20:48:51,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:51,896 INFO L129 PetriNetUnfolder]: 150/488 cut-off events. [2021-12-06 20:48:51,896 INFO L130 PetriNetUnfolder]: For 879/882 co-relation queries the response was YES. [2021-12-06 20:48:51,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 488 events. 150/488 cut-off events. For 879/882 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2150 event pairs, 19 based on Foata normal form. 8/475 useless extension candidates. Maximal degree in co-relation 1273. Up to 155 conditions per place. [2021-12-06 20:48:51,902 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 22 selfloop transitions, 11 changer transitions 19/148 dead transitions. [2021-12-06 20:48:51,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 148 transitions, 584 flow [2021-12-06 20:48:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 20:48:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 20:48:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1605 transitions. [2021-12-06 20:48:51,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8368091762252347 [2021-12-06 20:48:51,907 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1605 transitions. [2021-12-06 20:48:51,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1605 transitions. [2021-12-06 20:48:51,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:51,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1605 transitions. [2021-12-06 20:48:51,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.64285714285714) internal successors, (1605), 14 states have internal predecessors, (1605), 0 states have call successors, (0), 0 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 20:48:51,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 0 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 20:48:51,917 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 0 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 20:48:51,917 INFO L186 Difference]: Start difference. First operand has 152 places, 121 transitions, 336 flow. Second operand 14 states and 1605 transitions. [2021-12-06 20:48:51,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 148 transitions, 584 flow [2021-12-06 20:48:51,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 148 transitions, 560 flow, removed 7 selfloop flow, removed 8 redundant places. [2021-12-06 20:48:51,922 INFO L242 Difference]: Finished difference. Result has 158 places, 125 transitions, 387 flow [2021-12-06 20:48:51,923 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=387, PETRI_PLACES=158, PETRI_TRANSITIONS=125} [2021-12-06 20:48:51,923 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 14 predicate places. [2021-12-06 20:48:51,923 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 125 transitions, 387 flow [2021-12-06 20:48:51,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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 20:48:51,924 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:51,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:51,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 20:48:51,924 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1757255002, now seen corresponding path program 2 times [2021-12-06 20:48:51,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:51,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940408944] [2021-12-06 20:48:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:51,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:52,089 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 20:48:52,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:52,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940408944] [2021-12-06 20:48:52,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940408944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:52,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:52,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:48:52,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893554560] [2021-12-06 20:48:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:52,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:48:52,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:52,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:48:52,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:48:52,092 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 20:48:52,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 125 transitions, 387 flow. Second operand has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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 20:48:52,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:52,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 20:48:52,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:52,470 INFO L129 PetriNetUnfolder]: 247/727 cut-off events. [2021-12-06 20:48:52,470 INFO L130 PetriNetUnfolder]: For 3397/3407 co-relation queries the response was YES. [2021-12-06 20:48:52,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 727 events. 247/727 cut-off events. For 3397/3407 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4012 event pairs, 34 based on Foata normal form. 14/712 useless extension candidates. Maximal degree in co-relation 2588. Up to 156 conditions per place. [2021-12-06 20:48:52,485 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 35 selfloop transitions, 19 changer transitions 10/161 dead transitions. [2021-12-06 20:48:52,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 787 flow [2021-12-06 20:48:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:48:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 20:48:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1400 transitions. [2021-12-06 20:48:52,489 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.851581508515815 [2021-12-06 20:48:52,489 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1400 transitions. [2021-12-06 20:48:52,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1400 transitions. [2021-12-06 20:48:52,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:52,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1400 transitions. [2021-12-06 20:48:52,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.66666666666667) internal successors, (1400), 12 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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 20:48:52,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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 20:48:52,497 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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 20:48:52,498 INFO L186 Difference]: Start difference. First operand has 158 places, 125 transitions, 387 flow. Second operand 12 states and 1400 transitions. [2021-12-06 20:48:52,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 787 flow [2021-12-06 20:48:52,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 690 flow, removed 46 selfloop flow, removed 9 redundant places. [2021-12-06 20:48:52,505 INFO L242 Difference]: Finished difference. Result has 161 places, 136 transitions, 501 flow [2021-12-06 20:48:52,505 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=501, PETRI_PLACES=161, PETRI_TRANSITIONS=136} [2021-12-06 20:48:52,506 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 17 predicate places. [2021-12-06 20:48:52,506 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 136 transitions, 501 flow [2021-12-06 20:48:52,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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 20:48:52,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:52,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:52,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:48:52,507 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1456779200, now seen corresponding path program 3 times [2021-12-06 20:48:52,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:52,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086602111] [2021-12-06 20:48:52,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:52,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:52,682 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 20:48:52,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:52,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086602111] [2021-12-06 20:48:52,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086602111] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:52,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:52,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:48:52,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024030554] [2021-12-06 20:48:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:52,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:48:52,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:48:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:48:52,685 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-06 20:48:52,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 136 transitions, 501 flow. Second operand has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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 20:48:52,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:52,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-06 20:48:52,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:53,050 INFO L129 PetriNetUnfolder]: 262/793 cut-off events. [2021-12-06 20:48:53,050 INFO L130 PetriNetUnfolder]: For 2723/3081 co-relation queries the response was YES. [2021-12-06 20:48:53,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2937 conditions, 793 events. 262/793 cut-off events. For 2723/3081 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4846 event pairs, 41 based on Foata normal form. 32/794 useless extension candidates. Maximal degree in co-relation 2849. Up to 243 conditions per place. [2021-12-06 20:48:53,060 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 32 selfloop transitions, 16 changer transitions 19/163 dead transitions. [2021-12-06 20:48:53,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 861 flow [2021-12-06 20:48:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:48:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 20:48:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1495 transitions. [2021-12-06 20:48:53,064 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8394160583941606 [2021-12-06 20:48:53,064 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1495 transitions. [2021-12-06 20:48:53,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1495 transitions. [2021-12-06 20:48:53,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:53,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1495 transitions. [2021-12-06 20:48:53,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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 20:48:53,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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 20:48:53,072 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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 20:48:53,072 INFO L186 Difference]: Start difference. First operand has 161 places, 136 transitions, 501 flow. Second operand 13 states and 1495 transitions. [2021-12-06 20:48:53,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 861 flow [2021-12-06 20:48:53,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 826 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-12-06 20:48:53,080 INFO L242 Difference]: Finished difference. Result has 170 places, 138 transitions, 570 flow [2021-12-06 20:48:53,080 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=570, PETRI_PLACES=170, PETRI_TRANSITIONS=138} [2021-12-06 20:48:53,081 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 26 predicate places. [2021-12-06 20:48:53,081 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 138 transitions, 570 flow [2021-12-06 20:48:53,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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 20:48:53,081 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:53,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:53,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:48:53,082 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1826708927, now seen corresponding path program 1 times [2021-12-06 20:48:53,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:53,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030976255] [2021-12-06 20:48:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:53,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:53,293 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 20:48:53,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:53,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030976255] [2021-12-06 20:48:53,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030976255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:53,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:53,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 20:48:53,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360369541] [2021-12-06 20:48:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:53,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:48:53,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:53,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:48:53,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:48:53,298 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2021-12-06 20:48:53,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 138 transitions, 570 flow. Second operand has 14 states, 14 states have (on average 111.5) internal successors, (1561), 14 states have internal predecessors, (1561), 0 states have call successors, (0), 0 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 20:48:53,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:53,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2021-12-06 20:48:53,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:53,629 INFO L129 PetriNetUnfolder]: 187/632 cut-off events. [2021-12-06 20:48:53,629 INFO L130 PetriNetUnfolder]: For 3909/4317 co-relation queries the response was YES. [2021-12-06 20:48:53,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 632 events. 187/632 cut-off events. For 3909/4317 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3566 event pairs, 41 based on Foata normal form. 18/617 useless extension candidates. Maximal degree in co-relation 2647. Up to 272 conditions per place. [2021-12-06 20:48:53,638 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 33 selfloop transitions, 15 changer transitions 10/153 dead transitions. [2021-12-06 20:48:53,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 153 transitions, 854 flow [2021-12-06 20:48:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 20:48:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 20:48:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1693 transitions. [2021-12-06 20:48:53,643 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8238442822384429 [2021-12-06 20:48:53,643 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1693 transitions. [2021-12-06 20:48:53,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1693 transitions. [2021-12-06 20:48:53,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:53,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1693 transitions. [2021-12-06 20:48:53,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.86666666666666) internal successors, (1693), 15 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:48:53,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 0 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 20:48:53,652 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 0 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 20:48:53,652 INFO L186 Difference]: Start difference. First operand has 170 places, 138 transitions, 570 flow. Second operand 15 states and 1693 transitions. [2021-12-06 20:48:53,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 153 transitions, 854 flow [2021-12-06 20:48:53,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 153 transitions, 821 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-12-06 20:48:53,660 INFO L242 Difference]: Finished difference. Result has 178 places, 139 transitions, 625 flow [2021-12-06 20:48:53,661 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=625, PETRI_PLACES=178, PETRI_TRANSITIONS=139} [2021-12-06 20:48:53,661 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2021-12-06 20:48:53,661 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 139 transitions, 625 flow [2021-12-06 20:48:53,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 111.5) internal successors, (1561), 14 states have internal predecessors, (1561), 0 states have call successors, (0), 0 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 20:48:53,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:53,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:53,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:48:53,663 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:53,663 INFO L85 PathProgramCache]: Analyzing trace with hash 567236995, now seen corresponding path program 2 times [2021-12-06 20:48:53,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:53,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747123610] [2021-12-06 20:48:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:53,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:53,815 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 20:48:53,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:53,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747123610] [2021-12-06 20:48:53,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747123610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:53,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:53,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:48:53,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455446253] [2021-12-06 20:48:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:53,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:48:53,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:48:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:48:53,818 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 20:48:53,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 139 transitions, 625 flow. Second operand has 10 states, 10 states have (on average 113.9) internal successors, (1139), 10 states have internal predecessors, (1139), 0 states have call successors, (0), 0 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 20:48:53,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:53,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 20:48:53,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:54,083 INFO L129 PetriNetUnfolder]: 185/642 cut-off events. [2021-12-06 20:48:54,083 INFO L130 PetriNetUnfolder]: For 6121/6543 co-relation queries the response was YES. [2021-12-06 20:48:54,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3028 conditions, 642 events. 185/642 cut-off events. For 6121/6543 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3689 event pairs, 33 based on Foata normal form. 25/634 useless extension candidates. Maximal degree in co-relation 2931. Up to 253 conditions per place. [2021-12-06 20:48:54,092 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 36 selfloop transitions, 17 changer transitions 10/160 dead transitions. [2021-12-06 20:48:54,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 160 transitions, 1023 flow [2021-12-06 20:48:54,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:48:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 20:48:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1388 transitions. [2021-12-06 20:48:54,095 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442822384428224 [2021-12-06 20:48:54,095 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1388 transitions. [2021-12-06 20:48:54,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1388 transitions. [2021-12-06 20:48:54,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:54,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1388 transitions. [2021-12-06 20:48:54,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 115.66666666666667) internal successors, (1388), 12 states have internal predecessors, (1388), 0 states have call successors, (0), 0 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 20:48:54,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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 20:48:54,103 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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 20:48:54,103 INFO L186 Difference]: Start difference. First operand has 178 places, 139 transitions, 625 flow. Second operand 12 states and 1388 transitions. [2021-12-06 20:48:54,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 160 transitions, 1023 flow [2021-12-06 20:48:54,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 160 transitions, 895 flow, removed 51 selfloop flow, removed 13 redundant places. [2021-12-06 20:48:54,115 INFO L242 Difference]: Finished difference. Result has 178 places, 143 transitions, 688 flow [2021-12-06 20:48:54,115 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=688, PETRI_PLACES=178, PETRI_TRANSITIONS=143} [2021-12-06 20:48:54,116 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2021-12-06 20:48:54,116 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 143 transitions, 688 flow [2021-12-06 20:48:54,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.9) internal successors, (1139), 10 states have internal predecessors, (1139), 0 states have call successors, (0), 0 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 20:48:54,117 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:54,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:54,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:48:54,117 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 337220735, now seen corresponding path program 3 times [2021-12-06 20:48:54,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:54,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914366182] [2021-12-06 20:48:54,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:54,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:54,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 20:48:54,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914366182] [2021-12-06 20:48:54,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914366182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:54,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:54,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 20:48:54,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279716132] [2021-12-06 20:48:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:54,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 20:48:54,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 20:48:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:48:54,328 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2021-12-06 20:48:54,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 143 transitions, 688 flow. Second operand has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 0 states have call successors, (0), 0 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 20:48:54,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:54,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2021-12-06 20:48:54,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:54,708 INFO L129 PetriNetUnfolder]: 189/674 cut-off events. [2021-12-06 20:48:54,708 INFO L130 PetriNetUnfolder]: For 6181/6348 co-relation queries the response was YES. [2021-12-06 20:48:54,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3196 conditions, 674 events. 189/674 cut-off events. For 6181/6348 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3882 event pairs, 45 based on Foata normal form. 33/674 useless extension candidates. Maximal degree in co-relation 3099. Up to 279 conditions per place. [2021-12-06 20:48:54,718 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 36 selfloop transitions, 17 changer transitions 10/158 dead transitions. [2021-12-06 20:48:54,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 158 transitions, 1027 flow [2021-12-06 20:48:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 20:48:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 20:48:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1583 transitions. [2021-12-06 20:48:54,722 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8253388946819604 [2021-12-06 20:48:54,722 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1583 transitions. [2021-12-06 20:48:54,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1583 transitions. [2021-12-06 20:48:54,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:54,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1583 transitions. [2021-12-06 20:48:54,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.07142857142857) internal successors, (1583), 14 states have internal predecessors, (1583), 0 states have call successors, (0), 0 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 20:48:54,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 0 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 20:48:54,729 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 0 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 20:48:54,729 INFO L186 Difference]: Start difference. First operand has 178 places, 143 transitions, 688 flow. Second operand 14 states and 1583 transitions. [2021-12-06 20:48:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 158 transitions, 1027 flow [2021-12-06 20:48:54,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 158 transitions, 934 flow, removed 37 selfloop flow, removed 9 redundant places. [2021-12-06 20:48:54,740 INFO L242 Difference]: Finished difference. Result has 183 places, 144 transitions, 722 flow [2021-12-06 20:48:54,740 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=722, PETRI_PLACES=183, PETRI_TRANSITIONS=144} [2021-12-06 20:48:54,740 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 39 predicate places. [2021-12-06 20:48:54,741 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 144 transitions, 722 flow [2021-12-06 20:48:54,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 0 states have call successors, (0), 0 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 20:48:54,742 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:54,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:54,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 20:48:54,742 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 776780731, now seen corresponding path program 4 times [2021-12-06 20:48:54,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:54,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560735162] [2021-12-06 20:48:54,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:54,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:54,926 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 20:48:54,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560735162] [2021-12-06 20:48:54,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560735162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:54,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:54,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:48:54,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717557807] [2021-12-06 20:48:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:54,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:48:54,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:48:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:48:54,928 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-06 20:48:54,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 144 transitions, 722 flow. Second operand has 11 states, 11 states have (on average 112.81818181818181) internal successors, (1241), 11 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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 20:48:54,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:54,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-06 20:48:54,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:55,247 INFO L129 PetriNetUnfolder]: 166/757 cut-off events. [2021-12-06 20:48:55,247 INFO L130 PetriNetUnfolder]: For 5529/5952 co-relation queries the response was YES. [2021-12-06 20:48:55,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 757 events. 166/757 cut-off events. For 5529/5952 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5126 event pairs, 21 based on Foata normal form. 35/760 useless extension candidates. Maximal degree in co-relation 3124. Up to 167 conditions per place. [2021-12-06 20:48:55,257 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 39 selfloop transitions, 16 changer transitions 10/161 dead transitions. [2021-12-06 20:48:55,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 161 transitions, 1076 flow [2021-12-06 20:48:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:48:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 20:48:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1486 transitions. [2021-12-06 20:48:55,259 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8343627175743964 [2021-12-06 20:48:55,259 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1486 transitions. [2021-12-06 20:48:55,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1486 transitions. [2021-12-06 20:48:55,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:55,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1486 transitions. [2021-12-06 20:48:55,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.3076923076923) internal successors, (1486), 13 states have internal predecessors, (1486), 0 states have call successors, (0), 0 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 20:48:55,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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 20:48:55,264 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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 20:48:55,264 INFO L186 Difference]: Start difference. First operand has 183 places, 144 transitions, 722 flow. Second operand 13 states and 1486 transitions. [2021-12-06 20:48:55,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 161 transitions, 1076 flow [2021-12-06 20:48:55,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 161 transitions, 934 flow, removed 57 selfloop flow, removed 12 redundant places. [2021-12-06 20:48:55,279 INFO L242 Difference]: Finished difference. Result has 184 places, 144 transitions, 700 flow [2021-12-06 20:48:55,279 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=700, PETRI_PLACES=184, PETRI_TRANSITIONS=144} [2021-12-06 20:48:55,280 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 40 predicate places. [2021-12-06 20:48:55,280 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 144 transitions, 700 flow [2021-12-06 20:48:55,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.81818181818181) internal successors, (1241), 11 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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 20:48:55,280 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:55,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:55,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 20:48:55,281 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:55,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1831880635, now seen corresponding path program 1 times [2021-12-06 20:48:55,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:55,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564950323] [2021-12-06 20:48:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:55,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:55,353 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 20:48:55,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:55,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564950323] [2021-12-06 20:48:55,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564950323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:55,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:55,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:48:55,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864322796] [2021-12-06 20:48:55,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:55,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:48:55,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:48:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:48:55,355 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 20:48:55,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 144 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 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 20:48:55,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:55,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 20:48:55,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:56,563 INFO L129 PetriNetUnfolder]: 4593/8725 cut-off events. [2021-12-06 20:48:56,563 INFO L130 PetriNetUnfolder]: For 38509/40212 co-relation queries the response was YES. [2021-12-06 20:48:56,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28511 conditions, 8725 events. 4593/8725 cut-off events. For 38509/40212 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 75060 event pairs, 165 based on Foata normal form. 605/9028 useless extension candidates. Maximal degree in co-relation 28417. Up to 3244 conditions per place. [2021-12-06 20:48:56,641 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 151 selfloop transitions, 18 changer transitions 5/275 dead transitions. [2021-12-06 20:48:56,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 275 transitions, 2296 flow [2021-12-06 20:48:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:48:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 20:48:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1204 transitions. [2021-12-06 20:48:56,643 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8788321167883212 [2021-12-06 20:48:56,643 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1204 transitions. [2021-12-06 20:48:56,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1204 transitions. [2021-12-06 20:48:56,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:56,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1204 transitions. [2021-12-06 20:48:56,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.4) internal successors, (1204), 10 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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 20:48:56,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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 20:48:56,646 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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 20:48:56,646 INFO L186 Difference]: Start difference. First operand has 184 places, 144 transitions, 700 flow. Second operand 10 states and 1204 transitions. [2021-12-06 20:48:56,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 275 transitions, 2296 flow [2021-12-06 20:48:56,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 275 transitions, 2044 flow, removed 85 selfloop flow, removed 14 redundant places. [2021-12-06 20:48:56,700 INFO L242 Difference]: Finished difference. Result has 179 places, 160 transitions, 762 flow [2021-12-06 20:48:56,700 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=762, PETRI_PLACES=179, PETRI_TRANSITIONS=160} [2021-12-06 20:48:56,701 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 35 predicate places. [2021-12-06 20:48:56,701 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 160 transitions, 762 flow [2021-12-06 20:48:56,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 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 20:48:56,701 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:56,701 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, 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 20:48:56,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 20:48:56,702 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash 430264475, now seen corresponding path program 1 times [2021-12-06 20:48:56,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:56,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505715654] [2021-12-06 20:48:56,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:56,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:56,785 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 20:48:56,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:56,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505715654] [2021-12-06 20:48:56,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505715654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:56,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:56,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:48:56,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70773090] [2021-12-06 20:48:56,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:56,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:48:56,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:48:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:48:56,787 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 20:48:56,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 160 transitions, 762 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 20:48:56,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:56,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 20:48:56,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:58,162 INFO L129 PetriNetUnfolder]: 4382/8737 cut-off events. [2021-12-06 20:48:58,162 INFO L130 PetriNetUnfolder]: For 37180/38507 co-relation queries the response was YES. [2021-12-06 20:48:58,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35670 conditions, 8737 events. 4382/8737 cut-off events. For 37180/38507 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 79485 event pairs, 107 based on Foata normal form. 749/9359 useless extension candidates. Maximal degree in co-relation 35580. Up to 2953 conditions per place. [2021-12-06 20:48:58,240 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 176 selfloop transitions, 34 changer transitions 26/337 dead transitions. [2021-12-06 20:48:58,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 337 transitions, 2934 flow [2021-12-06 20:48:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:48:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 20:48:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1566 transitions. [2021-12-06 20:48:58,243 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8792813026389669 [2021-12-06 20:48:58,243 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1566 transitions. [2021-12-06 20:48:58,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1566 transitions. [2021-12-06 20:48:58,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:58,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1566 transitions. [2021-12-06 20:48:58,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.46153846153847) internal successors, (1566), 13 states have internal predecessors, (1566), 0 states have call successors, (0), 0 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 20:48:58,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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 20:48:58,248 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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 20:48:58,248 INFO L186 Difference]: Start difference. First operand has 179 places, 160 transitions, 762 flow. Second operand 13 states and 1566 transitions. [2021-12-06 20:48:58,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 337 transitions, 2934 flow [2021-12-06 20:48:58,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 337 transitions, 2932 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 20:48:58,311 INFO L242 Difference]: Finished difference. Result has 196 places, 178 transitions, 1024 flow [2021-12-06 20:48:58,311 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1024, PETRI_PLACES=196, PETRI_TRANSITIONS=178} [2021-12-06 20:48:58,312 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 52 predicate places. [2021-12-06 20:48:58,312 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 178 transitions, 1024 flow [2021-12-06 20:48:58,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 20:48:58,313 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:58,313 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, 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 20:48:58,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 20:48:58,313 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:58,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1696250602, now seen corresponding path program 1 times [2021-12-06 20:48:58,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:58,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913716412] [2021-12-06 20:48:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:58,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:58,389 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 20:48:58,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:58,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913716412] [2021-12-06 20:48:58,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913716412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:58,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:58,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:48:58,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235765304] [2021-12-06 20:48:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:58,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:48:58,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:48:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:48:58,392 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2021-12-06 20:48:58,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 178 transitions, 1024 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 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 20:48:58,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:58,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2021-12-06 20:48:58,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:48:59,202 INFO L129 PetriNetUnfolder]: 1409/5209 cut-off events. [2021-12-06 20:48:59,202 INFO L130 PetriNetUnfolder]: For 21989/29057 co-relation queries the response was YES. [2021-12-06 20:48:59,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20409 conditions, 5209 events. 1409/5209 cut-off events. For 21989/29057 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 59322 event pairs, 164 based on Foata normal form. 280/5052 useless extension candidates. Maximal degree in co-relation 20311. Up to 1580 conditions per place. [2021-12-06 20:48:59,248 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 69 selfloop transitions, 11 changer transitions 18/235 dead transitions. [2021-12-06 20:48:59,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 235 transitions, 1729 flow [2021-12-06 20:48:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:48:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 20:48:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2021-12-06 20:48:59,250 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8767234387672344 [2021-12-06 20:48:59,250 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2021-12-06 20:48:59,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2021-12-06 20:48:59,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:48:59,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2021-12-06 20:48:59,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 0 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 20:48:59,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 20:48:59,252 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 20:48:59,252 INFO L186 Difference]: Start difference. First operand has 196 places, 178 transitions, 1024 flow. Second operand 9 states and 1081 transitions. [2021-12-06 20:48:59,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 235 transitions, 1729 flow [2021-12-06 20:48:59,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 235 transitions, 1640 flow, removed 36 selfloop flow, removed 4 redundant places. [2021-12-06 20:48:59,366 INFO L242 Difference]: Finished difference. Result has 207 places, 186 transitions, 1062 flow [2021-12-06 20:48:59,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1062, PETRI_PLACES=207, PETRI_TRANSITIONS=186} [2021-12-06 20:48:59,367 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 63 predicate places. [2021-12-06 20:48:59,367 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 186 transitions, 1062 flow [2021-12-06 20:48:59,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 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 20:48:59,367 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:48:59,367 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, 1, 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 20:48:59,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 20:48:59,368 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:48:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:59,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1222821100, now seen corresponding path program 1 times [2021-12-06 20:48:59,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:48:59,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433216098] [2021-12-06 20:48:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:59,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:48:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:59,446 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 20:48:59,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:48:59,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433216098] [2021-12-06 20:48:59,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433216098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:59,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:59,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:48:59,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132356168] [2021-12-06 20:48:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:59,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:48:59,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:48:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:48:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:48:59,448 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 20:48:59,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 186 transitions, 1062 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 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 20:48:59,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:48:59,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 20:48:59,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:49:01,492 INFO L129 PetriNetUnfolder]: 5825/12026 cut-off events. [2021-12-06 20:49:01,492 INFO L130 PetriNetUnfolder]: For 78717/80482 co-relation queries the response was YES. [2021-12-06 20:49:01,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56080 conditions, 12026 events. 5825/12026 cut-off events. For 78717/80482 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 120606 event pairs, 82 based on Foata normal form. 1150/13026 useless extension candidates. Maximal degree in co-relation 55976. Up to 3072 conditions per place. [2021-12-06 20:49:01,566 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 74 selfloop transitions, 15 changer transitions 174/361 dead transitions. [2021-12-06 20:49:01,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 361 transitions, 3388 flow [2021-12-06 20:49:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:49:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 20:49:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1927 transitions. [2021-12-06 20:49:01,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8791058394160584 [2021-12-06 20:49:01,569 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1927 transitions. [2021-12-06 20:49:01,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1927 transitions. [2021-12-06 20:49:01,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:49:01,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1927 transitions. [2021-12-06 20:49:01,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.4375) internal successors, (1927), 16 states have internal predecessors, (1927), 0 states have call successors, (0), 0 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 20:49:01,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 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 20:49:01,573 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 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 20:49:01,573 INFO L186 Difference]: Start difference. First operand has 207 places, 186 transitions, 1062 flow. Second operand 16 states and 1927 transitions. [2021-12-06 20:49:01,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 361 transitions, 3388 flow [2021-12-06 20:49:01,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 361 transitions, 3039 flow, removed 22 selfloop flow, removed 12 redundant places. [2021-12-06 20:49:01,862 INFO L242 Difference]: Finished difference. Result has 216 places, 140 transitions, 709 flow [2021-12-06 20:49:01,863 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=709, PETRI_PLACES=216, PETRI_TRANSITIONS=140} [2021-12-06 20:49:01,863 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 72 predicate places. [2021-12-06 20:49:01,863 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 140 transitions, 709 flow [2021-12-06 20:49:01,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 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 20:49:01,863 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:49:01,863 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, 1, 1, 1, 1, 1, 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 20:49:01,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 20:49:01,864 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:49:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash 278877526, now seen corresponding path program 1 times [2021-12-06 20:49:01,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:01,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735863375] [2021-12-06 20:49:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:01,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:02,004 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 20:49:02,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:02,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735863375] [2021-12-06 20:49:02,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735863375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:02,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:02,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:49:02,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40996451] [2021-12-06 20:49:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:02,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:49:02,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:49:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:49:02,006 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-12-06 20:49:02,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 140 transitions, 709 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 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 20:49:02,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:49:02,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-12-06 20:49:02,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:49:02,460 INFO L129 PetriNetUnfolder]: 603/2628 cut-off events. [2021-12-06 20:49:02,460 INFO L130 PetriNetUnfolder]: For 17481/18177 co-relation queries the response was YES. [2021-12-06 20:49:02,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10636 conditions, 2628 events. 603/2628 cut-off events. For 17481/18177 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 24936 event pairs, 58 based on Foata normal form. 95/2598 useless extension candidates. Maximal degree in co-relation 10531. Up to 689 conditions per place. [2021-12-06 20:49:02,482 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 58 selfloop transitions, 2 changer transitions 11/183 dead transitions. [2021-12-06 20:49:02,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 183 transitions, 1214 flow [2021-12-06 20:49:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:49:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 20:49:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2021-12-06 20:49:02,484 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759124087591241 [2021-12-06 20:49:02,484 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2021-12-06 20:49:02,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2021-12-06 20:49:02,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:49:02,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2021-12-06 20:49:02,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 20:49:02,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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 20:49:02,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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 20:49:02,486 INFO L186 Difference]: Start difference. First operand has 216 places, 140 transitions, 709 flow. Second operand 7 states and 840 transitions. [2021-12-06 20:49:02,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 183 transitions, 1214 flow [2021-12-06 20:49:02,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 183 transitions, 979 flow, removed 79 selfloop flow, removed 29 redundant places. [2021-12-06 20:49:02,535 INFO L242 Difference]: Finished difference. Result has 172 places, 141 transitions, 547 flow [2021-12-06 20:49:02,535 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=547, PETRI_PLACES=172, PETRI_TRANSITIONS=141} [2021-12-06 20:49:02,535 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 28 predicate places. [2021-12-06 20:49:02,535 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 141 transitions, 547 flow [2021-12-06 20:49:02,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 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 20:49:02,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:49:02,536 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, 1, 1, 1, 1, 1, 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 20:49:02,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 20:49:02,536 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:49:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1894116068, now seen corresponding path program 2 times [2021-12-06 20:49:02,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974453532] [2021-12-06 20:49:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:02,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:02,616 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 20:49:02,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:02,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974453532] [2021-12-06 20:49:02,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974453532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:02,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:02,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:49:02,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173441095] [2021-12-06 20:49:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:02,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:02,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:02,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:02,618 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 20:49:02,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 141 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 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 20:49:02,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:49:02,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 20:49:02,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:49:03,121 INFO L129 PetriNetUnfolder]: 929/2860 cut-off events. [2021-12-06 20:49:03,121 INFO L130 PetriNetUnfolder]: For 6926/7343 co-relation queries the response was YES. [2021-12-06 20:49:03,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8983 conditions, 2860 events. 929/2860 cut-off events. For 6926/7343 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26195 event pairs, 2 based on Foata normal form. 181/2942 useless extension candidates. Maximal degree in co-relation 8946. Up to 567 conditions per place. [2021-12-06 20:49:03,133 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 50 selfloop transitions, 19 changer transitions 41/206 dead transitions. [2021-12-06 20:49:03,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 206 transitions, 1255 flow [2021-12-06 20:49:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:49:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 20:49:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1414 transitions. [2021-12-06 20:49:03,135 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8600973236009732 [2021-12-06 20:49:03,135 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1414 transitions. [2021-12-06 20:49:03,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1414 transitions. [2021-12-06 20:49:03,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:49:03,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1414 transitions. [2021-12-06 20:49:03,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.83333333333333) internal successors, (1414), 12 states have internal predecessors, (1414), 0 states have call successors, (0), 0 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 20:49:03,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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 20:49:03,138 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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 20:49:03,139 INFO L186 Difference]: Start difference. First operand has 172 places, 141 transitions, 547 flow. Second operand 12 states and 1414 transitions. [2021-12-06 20:49:03,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 206 transitions, 1255 flow [2021-12-06 20:49:03,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 206 transitions, 1120 flow, removed 60 selfloop flow, removed 12 redundant places. [2021-12-06 20:49:03,154 INFO L242 Difference]: Finished difference. Result has 174 places, 137 transitions, 528 flow [2021-12-06 20:49:03,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=528, PETRI_PLACES=174, PETRI_TRANSITIONS=137} [2021-12-06 20:49:03,155 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 30 predicate places. [2021-12-06 20:49:03,155 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 137 transitions, 528 flow [2021-12-06 20:49:03,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 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 20:49:03,155 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:49:03,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:49:03,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 20:49:03,156 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:49:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash 801011764, now seen corresponding path program 1 times [2021-12-06 20:49:03,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:03,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116951104] [2021-12-06 20:49:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:03,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:03,228 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 20:49:03,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:03,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116951104] [2021-12-06 20:49:03,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116951104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:03,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:03,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:49:03,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173454393] [2021-12-06 20:49:03,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:03,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:49:03,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:49:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:49:03,230 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-12-06 20:49:03,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 137 transitions, 528 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 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 20:49:03,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 20:49:03,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-12-06 20:49:03,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 20:49:03,423 INFO L129 PetriNetUnfolder]: 245/1099 cut-off events. [2021-12-06 20:49:03,423 INFO L130 PetriNetUnfolder]: For 1353/1514 co-relation queries the response was YES. [2021-12-06 20:49:03,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 1099 events. 245/1099 cut-off events. For 1353/1514 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8179 event pairs, 6 based on Foata normal form. 11/1058 useless extension candidates. Maximal degree in co-relation 2773. Up to 201 conditions per place. [2021-12-06 20:49:03,429 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 1 changer transitions 32/160 dead transitions. [2021-12-06 20:49:03,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 160 transitions, 754 flow [2021-12-06 20:49:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:49:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 20:49:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2021-12-06 20:49:03,430 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8665276329509907 [2021-12-06 20:49:03,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2021-12-06 20:49:03,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2021-12-06 20:49:03,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 20:49:03,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2021-12-06 20:49:03,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 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 20:49:03,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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 20:49:03,432 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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 20:49:03,433 INFO L186 Difference]: Start difference. First operand has 174 places, 137 transitions, 528 flow. Second operand 7 states and 831 transitions. [2021-12-06 20:49:03,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 160 transitions, 754 flow [2021-12-06 20:49:03,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 160 transitions, 609 flow, removed 29 selfloop flow, removed 22 redundant places. [2021-12-06 20:49:03,441 INFO L242 Difference]: Finished difference. Result has 159 places, 128 transitions, 345 flow [2021-12-06 20:49:03,441 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=159, PETRI_TRANSITIONS=128} [2021-12-06 20:49:03,441 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 15 predicate places. [2021-12-06 20:49:03,441 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 128 transitions, 345 flow [2021-12-06 20:49:03,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 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 20:49:03,442 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 20:49:03,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:49:03,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 20:49:03,442 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 20:49:03,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1830510262, now seen corresponding path program 2 times [2021-12-06 20:49:03,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:03,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337478185] [2021-12-06 20:49:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:03,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 20:49:03,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 20:49:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 20:49:03,539 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 20:49:03,539 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 20:49:03,540 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-06 20:49:03,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-06 20:49:03,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-06 20:49:03,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-06 20:49:03,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-06 20:49:03,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-06 20:49:03,541 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-06 20:49:03,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 20:49:03,544 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:03,548 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 20:49:03,548 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 20:49:03,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:49:03 BasicIcfg [2021-12-06 20:49:03,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 20:49:03,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 20:49:03,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 20:49:03,668 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 20:49:03,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:48:49" (3/4) ... [2021-12-06 20:49:03,669 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 20:49:03,758 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 20:49:03,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 20:49:03,759 INFO L158 Benchmark]: Toolchain (without parser) took 15729.10ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 80.9MB in the beginning and 435.5MB in the end (delta: -354.5MB). Peak memory consumption was 619.5MB. Max. memory is 16.1GB. [2021-12-06 20:49:03,759 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 123.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 20:49:03,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.90ms. Allocated memory is still 123.7MB. Free memory was 80.8MB in the beginning and 57.9MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-06 20:49:03,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.50ms. Allocated memory is still 123.7MB. Free memory was 57.9MB in the beginning and 54.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 20:49:03,760 INFO L158 Benchmark]: Boogie Preprocessor took 38.32ms. Allocated memory is still 123.7MB. Free memory was 54.9MB in the beginning and 52.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 20:49:03,761 INFO L158 Benchmark]: RCFGBuilder took 696.16ms. Allocated memory is still 123.7MB. Free memory was 52.6MB in the beginning and 88.4MB in the end (delta: -35.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2021-12-06 20:49:03,761 INFO L158 Benchmark]: TraceAbstraction took 14512.46ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 87.8MB in the beginning and 476.4MB in the end (delta: -388.5MB). Peak memory consumption was 582.4MB. Max. memory is 16.1GB. [2021-12-06 20:49:03,761 INFO L158 Benchmark]: Witness Printer took 90.67ms. Allocated memory is still 1.1GB. Free memory was 476.4MB in the beginning and 435.5MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-12-06 20:49:03,763 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.19ms. Allocated memory is still 123.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.90ms. Allocated memory is still 123.7MB. Free memory was 80.8MB in the beginning and 57.9MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.50ms. Allocated memory is still 123.7MB. Free memory was 57.9MB in the beginning and 54.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.32ms. Allocated memory is still 123.7MB. Free memory was 54.9MB in the beginning and 52.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 696.16ms. Allocated memory is still 123.7MB. Free memory was 52.6MB in the beginning and 88.4MB in the end (delta: -35.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14512.46ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 87.8MB in the beginning and 476.4MB in the end (delta: -388.5MB). Peak memory consumption was 582.4MB. Max. memory is 16.1GB. * Witness Printer took 90.67ms. Allocated memory is still 1.1GB. Free memory was 476.4MB in the beginning and 435.5MB in the end (delta: 40.9MB). Peak memory consumption was 41.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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 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: 14.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 888 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 888 mSDsluCounter, 879 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1446 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2336 IncrementalHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 164 mSDtfsCounter, 2336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1062occurred in iteration=14, InterpolantAutomatonStates: 203, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1792 NumberOfCodeBlocks, 1792 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1668 ConstructedInterpolants, 0 QuantifiedInterpolants, 8985 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 20:49:03,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fca21f10-8c52-49da-849f-88cabe32ae62/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