./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU --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 be2a0d1eee532c8ad9f827ec91fa18dbacb100bdaebd8afe9a7f9b56098458ea --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:07:39,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:07:39,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:07:39,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:07:39,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:07:39,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:07:39,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:07:39,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:07:39,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:07:39,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:07:39,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:07:39,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:07:39,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:07:39,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:07:39,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:07:39,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:07:39,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:07:39,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:07:39,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:07:39,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:07:39,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:07:40,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:07:40,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:07:40,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:07:40,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:07:40,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:07:40,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:07:40,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:07:40,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:07:40,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:07:40,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:07:40,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:07:40,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:07:40,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:07:40,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:07:40,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:07:40,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:07:40,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:07:40,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:07:40,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:07:40,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:07:40,037 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 22:07:40,106 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:07:40,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:07:40,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:07:40,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:07:40,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:07:40,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:07:40,118 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:07:40,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:07:40,119 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:07:40,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:07:40,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:07:40,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:07:40,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:07:40,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:07:40,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:07:40,122 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:07:40,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:07:40,123 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:07:40,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:07:40,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:07:40,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:07:40,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:07:40,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:07:40,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:07:40,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:07:40,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:07:40,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:07:40,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:07:40,127 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:07:40,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:07:40,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:07:40,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:07:40,130 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_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/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_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU 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 -> be2a0d1eee532c8ad9f827ec91fa18dbacb100bdaebd8afe9a7f9b56098458ea [2021-11-02 22:07:40,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:07:40,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:07:40,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:07:40,487 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:07:40,488 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:07:40,489 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2021-11-02 22:07:40,561 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/data/1b945403f/91fd43054cfb4af4a4a61cb4234eb936/FLAGb70113e57 [2021-11-02 22:07:41,230 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:07:41,231 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2021-11-02 22:07:41,239 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/data/1b945403f/91fd43054cfb4af4a4a61cb4234eb936/FLAGb70113e57 [2021-11-02 22:07:41,585 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/data/1b945403f/91fd43054cfb4af4a4a61cb4234eb936 [2021-11-02 22:07:41,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:07:41,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:07:41,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:07:41,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:07:41,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:07:41,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:41,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4820f671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41, skipping insertion in model container [2021-11-02 22:07:41,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:41,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:07:41,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:07:41,884 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c[3015,3028] [2021-11-02 22:07:41,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:07:41,905 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:07:41,938 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c[3015,3028] [2021-11-02 22:07:41,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:07:41,960 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:07:41,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41 WrapperNode [2021-11-02 22:07:41,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:07:41,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:07:41,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:07:41,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:07:41,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:07:42,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:07:42,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:07:42,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:07:42,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:07:42,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:07:42,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:07:42,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:07:42,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (1/1) ... [2021-11-02 22:07:42,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:07:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:07:42,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:07:42,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2d67d2-bda7-4d86-8e6c-815cf6f3ca82/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:07:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-02 22:07:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-02 22:07:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-02 22:07:42,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-02 22:07:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-02 22:07:42,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-02 22:07:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:07:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:07:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 22:07:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:07:42,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:07:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 22:07:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:07:42,271 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-02 22:07:43,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:07:43,043 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-11-02 22:07:43,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:07:43 BoogieIcfgContainer [2021-11-02 22:07:43,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:07:43,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:07:43,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:07:43,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:07:43,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:07:41" (1/3) ... [2021-11-02 22:07:43,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18436d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:07:43, skipping insertion in model container [2021-11-02 22:07:43,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:07:41" (2/3) ... [2021-11-02 22:07:43,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18436d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:07:43, skipping insertion in model container [2021-11-02 22:07:43,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:07:43" (3/3) ... [2021-11-02 22:07:43,065 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2021-11-02 22:07:43,073 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-02 22:07:43,074 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:07:43,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-02 22:07:43,074 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-02 22:07:43,181 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,181 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,182 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,182 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,182 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,183 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,183 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,183 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,183 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,184 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,184 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,185 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,185 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,185 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,186 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,186 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,187 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,187 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,187 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,188 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,189 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,189 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,190 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,190 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,190 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,190 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,192 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,192 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,192 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,194 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,194 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,194 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,194 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,195 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,198 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,198 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,199 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,199 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,199 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,199 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,200 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,200 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,200 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,200 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,201 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,201 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,201 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,201 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,202 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,202 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,202 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,202 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,203 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,203 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,204 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,204 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,204 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,204 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,205 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,205 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,205 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,206 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,206 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,207 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,207 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,207 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,208 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,209 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,209 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,209 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,210 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,210 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,211 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,211 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,212 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,213 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,213 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,213 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,213 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,214 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,216 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,217 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,221 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,222 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,222 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,224 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,224 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,225 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,226 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,226 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,227 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,234 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,234 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,234 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,235 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,236 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,236 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,236 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,236 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,237 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,237 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,237 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,237 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,238 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,239 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,239 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,243 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,243 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,251 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,257 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,258 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,258 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,259 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,259 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,259 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,259 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,259 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,260 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,260 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,260 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,260 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,261 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,261 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,261 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,261 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,262 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,262 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,262 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,262 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,263 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,263 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,263 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,263 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,264 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,264 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,264 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,264 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,264 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,265 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,265 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,265 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,265 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,266 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,266 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,266 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,266 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,267 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,267 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,267 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,267 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,268 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,268 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,268 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,270 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,275 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,276 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,276 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,276 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,310 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,310 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,310 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,310 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,310 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,311 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,311 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,311 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,311 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,311 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,311 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,312 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,312 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,312 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,312 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,312 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,313 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,314 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,314 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,314 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,314 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,314 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,315 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,315 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,315 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,315 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,315 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,316 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,316 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,316 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,316 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,316 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,317 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,317 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,317 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,317 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,317 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,318 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,318 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,319 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,319 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,319 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,319 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,319 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,320 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,320 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,320 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,320 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,320 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,320 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,321 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,321 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,321 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,321 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,321 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,321 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,322 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,322 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,322 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,322 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,322 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,323 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,323 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,323 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,323 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,323 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,323 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,324 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,324 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,324 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,324 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,324 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,324 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,325 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,325 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,325 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,325 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,325 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,325 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,326 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,326 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,335 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,350 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,350 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,350 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,350 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,350 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,351 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,351 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,351 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,351 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,351 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,352 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,352 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,352 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,352 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,352 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,352 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,355 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,355 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,355 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,355 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,355 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,355 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,356 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,356 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,356 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,356 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,356 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,357 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,357 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,357 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,357 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,357 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,357 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,358 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,358 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,358 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,358 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,358 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,358 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,359 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,359 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,359 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,379 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,379 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,379 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,380 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,380 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,380 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,380 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,381 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,394 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,394 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,395 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,395 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,395 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,395 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,395 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,396 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,405 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,406 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,406 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,406 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,406 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,407 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,407 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,407 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,407 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,408 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,408 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,408 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,408 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,409 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,410 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,410 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,412 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,414 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,414 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,414 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,414 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,415 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,415 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,415 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,415 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,416 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,416 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 22:07:43,428 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-02 22:07:43,505 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:07:43,516 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-11-02 22:07:43,517 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-02 22:07:43,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 244 places, 260 transitions, 544 flow [2021-11-02 22:07:43,721 INFO L129 PetriNetUnfolder]: 26/257 cut-off events. [2021-11-02 22:07:43,721 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-02 22:07:43,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 257 events. 26/257 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 675 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 181. Up to 2 conditions per place. [2021-11-02 22:07:43,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 260 transitions, 544 flow [2021-11-02 22:07:43,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 247 transitions, 512 flow [2021-11-02 22:07:43,845 INFO L129 PetriNetUnfolder]: 26/246 cut-off events. [2021-11-02 22:07:43,847 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-02 22:07:43,850 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:43,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:43,851 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:43,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:43,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1653813269, now seen corresponding path program 1 times [2021-11-02 22:07:43,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:43,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803197272] [2021-11-02 22:07:43,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:43,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:44,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:44,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803197272] [2021-11-02 22:07:44,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803197272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:44,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:44,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:44,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661188524] [2021-11-02 22:07:44,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:07:44,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:44,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:07:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:07:44,280 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 260 [2021-11-02 22:07:44,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 247 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:44,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 260 [2021-11-02 22:07:44,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:44,424 INFO L129 PetriNetUnfolder]: 27/382 cut-off events. [2021-11-02 22:07:44,424 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-11-02 22:07:44,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 382 events. 27/382 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1756 event pairs, 1 based on Foata normal form. 18/359 useless extension candidates. Maximal degree in co-relation 313. Up to 7 conditions per place. [2021-11-02 22:07:44,436 INFO L132 encePairwiseOnDemand]: 248/260 looper letters, 6 selfloop transitions, 2 changer transitions 2/241 dead transitions. [2021-11-02 22:07:44,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 241 transitions, 516 flow [2021-11-02 22:07:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:07:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 22:07:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2021-11-02 22:07:44,458 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9756410256410256 [2021-11-02 22:07:44,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 761 transitions. [2021-11-02 22:07:44,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 761 transitions. [2021-11-02 22:07:44,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:44,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 761 transitions. [2021-11-02 22:07:44,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,490 INFO L186 Difference]: Start difference. First operand has 231 places, 247 transitions, 512 flow. Second operand 3 states and 761 transitions. [2021-11-02 22:07:44,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 241 transitions, 516 flow [2021-11-02 22:07:44,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 241 transitions, 504 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-11-02 22:07:44,506 INFO L242 Difference]: Finished difference. Result has 229 places, 239 transitions, 500 flow [2021-11-02 22:07:44,508 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=229, PETRI_TRANSITIONS=239} [2021-11-02 22:07:44,510 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, -2 predicate places. [2021-11-02 22:07:44,510 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 239 transitions, 500 flow [2021-11-02 22:07:44,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,511 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:44,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:44,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:07:44,512 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash -949081011, now seen corresponding path program 1 times [2021-11-02 22:07:44,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:44,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310688580] [2021-11-02 22:07:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:44,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:44,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:44,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310688580] [2021-11-02 22:07:44,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310688580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:44,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:44,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:44,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401382246] [2021-11-02 22:07:44,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:07:44,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:44,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:07:44,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:07:44,646 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 260 [2021-11-02 22:07:44,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 239 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:44,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 260 [2021-11-02 22:07:44,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:44,778 INFO L129 PetriNetUnfolder]: 23/338 cut-off events. [2021-11-02 22:07:44,778 INFO L130 PetriNetUnfolder]: For 14/24 co-relation queries the response was YES. [2021-11-02 22:07:44,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 338 events. 23/338 cut-off events. For 14/24 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1385 event pairs, 0 based on Foata normal form. 3/311 useless extension candidates. Maximal degree in co-relation 285. Up to 6 conditions per place. [2021-11-02 22:07:44,786 INFO L132 encePairwiseOnDemand]: 254/260 looper letters, 6 selfloop transitions, 4 changer transitions 0/241 dead transitions. [2021-11-02 22:07:44,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 241 transitions, 528 flow [2021-11-02 22:07:44,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:07:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 22:07:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2021-11-02 22:07:44,791 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9551282051282052 [2021-11-02 22:07:44,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 745 transitions. [2021-11-02 22:07:44,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 745 transitions. [2021-11-02 22:07:44,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:44,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 745 transitions. [2021-11-02 22:07:44,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,803 INFO L186 Difference]: Start difference. First operand has 229 places, 239 transitions, 500 flow. Second operand 3 states and 745 transitions. [2021-11-02 22:07:44,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 241 transitions, 528 flow [2021-11-02 22:07:44,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 241 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-02 22:07:44,822 INFO L242 Difference]: Finished difference. Result has 230 places, 241 transitions, 530 flow [2021-11-02 22:07:44,823 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=230, PETRI_TRANSITIONS=241} [2021-11-02 22:07:44,823 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, -1 predicate places. [2021-11-02 22:07:44,824 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 241 transitions, 530 flow [2021-11-02 22:07:44,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:44,825 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:44,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:44,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:07:44,826 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:44,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1855017939, now seen corresponding path program 1 times [2021-11-02 22:07:44,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:44,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728449020] [2021-11-02 22:07:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:44,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:45,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:45,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728449020] [2021-11-02 22:07:45,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728449020] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:45,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:45,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 22:07:45,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816135014] [2021-11-02 22:07:45,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:07:45,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:07:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:07:45,210 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 260 [2021-11-02 22:07:45,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 241 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 234.14285714285714) internal successors, (1639), 7 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:45,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:45,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 260 [2021-11-02 22:07:45,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:45,437 INFO L129 PetriNetUnfolder]: 22/360 cut-off events. [2021-11-02 22:07:45,437 INFO L130 PetriNetUnfolder]: For 11/18 co-relation queries the response was YES. [2021-11-02 22:07:45,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 360 events. 22/360 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1563 event pairs, 0 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 283. Up to 28 conditions per place. [2021-11-02 22:07:45,446 INFO L132 encePairwiseOnDemand]: 252/260 looper letters, 16 selfloop transitions, 5 changer transitions 3/248 dead transitions. [2021-11-02 22:07:45,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 248 transitions, 592 flow [2021-11-02 22:07:45,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:07:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-02 22:07:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2113 transitions. [2021-11-02 22:07:45,456 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.902991452991453 [2021-11-02 22:07:45,456 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2113 transitions. [2021-11-02 22:07:45,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2113 transitions. [2021-11-02 22:07:45,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:45,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2113 transitions. [2021-11-02 22:07:45,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 234.77777777777777) internal successors, (2113), 9 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:45,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:45,481 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:45,481 INFO L186 Difference]: Start difference. First operand has 230 places, 241 transitions, 530 flow. Second operand 9 states and 2113 transitions. [2021-11-02 22:07:45,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 248 transitions, 592 flow [2021-11-02 22:07:45,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 248 transitions, 580 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-11-02 22:07:45,492 INFO L242 Difference]: Finished difference. Result has 243 places, 245 transitions, 559 flow [2021-11-02 22:07:45,493 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=559, PETRI_PLACES=243, PETRI_TRANSITIONS=245} [2021-11-02 22:07:45,493 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 12 predicate places. [2021-11-02 22:07:45,493 INFO L470 AbstractCegarLoop]: Abstraction has has 243 places, 245 transitions, 559 flow [2021-11-02 22:07:45,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 234.14285714285714) internal successors, (1639), 7 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:45,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:45,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:45,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 22:07:45,496 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:45,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1735927467, now seen corresponding path program 1 times [2021-11-02 22:07:45,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:45,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471449041] [2021-11-02 22:07:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:45,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:45,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:45,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471449041] [2021-11-02 22:07:45,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471449041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:45,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:45,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:07:45,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544212850] [2021-11-02 22:07:45,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:07:45,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:45,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:07:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:07:45,860 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:07:45,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 245 transitions, 559 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:45,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:45,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:07:45,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:46,582 INFO L129 PetriNetUnfolder]: 335/1287 cut-off events. [2021-11-02 22:07:46,582 INFO L130 PetriNetUnfolder]: For 8/11 co-relation queries the response was YES. [2021-11-02 22:07:46,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 1287 events. 335/1287 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9289 event pairs, 64 based on Foata normal form. 1/1190 useless extension candidates. Maximal degree in co-relation 1960. Up to 217 conditions per place. [2021-11-02 22:07:46,617 INFO L132 encePairwiseOnDemand]: 245/260 looper letters, 64 selfloop transitions, 37 changer transitions 7/327 dead transitions. [2021-11-02 22:07:46,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 327 transitions, 954 flow [2021-11-02 22:07:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 22:07:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-02 22:07:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3677 transitions. [2021-11-02 22:07:46,633 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8838942307692308 [2021-11-02 22:07:46,633 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3677 transitions. [2021-11-02 22:07:46,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3677 transitions. [2021-11-02 22:07:46,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:46,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3677 transitions. [2021-11-02 22:07:46,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 229.8125) internal successors, (3677), 16 states have internal predecessors, (3677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:46,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 260.0) internal successors, (4420), 17 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:46,672 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 260.0) internal successors, (4420), 17 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:46,673 INFO L186 Difference]: Start difference. First operand has 243 places, 245 transitions, 559 flow. Second operand 16 states and 3677 transitions. [2021-11-02 22:07:46,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 327 transitions, 954 flow [2021-11-02 22:07:46,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 327 transitions, 941 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-11-02 22:07:46,686 INFO L242 Difference]: Finished difference. Result has 266 places, 279 transitions, 814 flow [2021-11-02 22:07:46,687 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=814, PETRI_PLACES=266, PETRI_TRANSITIONS=279} [2021-11-02 22:07:46,687 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 35 predicate places. [2021-11-02 22:07:46,687 INFO L470 AbstractCegarLoop]: Abstraction has has 266 places, 279 transitions, 814 flow [2021-11-02 22:07:46,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:46,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:46,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:46,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 22:07:46,690 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1843500473, now seen corresponding path program 1 times [2021-11-02 22:07:46,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:46,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124300054] [2021-11-02 22:07:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:46,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:46,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:46,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124300054] [2021-11-02 22:07:46,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124300054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:46,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:46,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:46,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036244450] [2021-11-02 22:07:46,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:07:46,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:07:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:07:46,823 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 260 [2021-11-02 22:07:46,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 279 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:46,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:46,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 260 [2021-11-02 22:07:46,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:47,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([748] L56-27-->L56-28: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork0_#t~ite23_5|) InVars {thread3Thread1of1ForFork0_#t~ite23=|v_thread3Thread1of1ForFork0_#t~ite23_5|} OutVars{~result_11~0=v_~result_11~0_1, thread3Thread1of1ForFork0_#t~ite23=|v_thread3Thread1of1ForFork0_#t~ite23_5|} AuxVars[] AssignedVars[~result_11~0][185], [Black: 288#(= ~result_10~0 0), 130#L50-28true, Black: 253#true, 201#L56-28true, Black: 295#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0)), Black: 305#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0) (= |thread3Thread1of1ForFork0_#t~ite23| 0)), Black: 311#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite16| 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0) (= |thread3Thread1of1ForFork0_#t~ite23| 0)), Black: 317#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_10~0 0) (= ~result_11~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 297#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite16| 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0)), Black: 291#(and (= ~result_10~0 0) (= ~result_11~0 0)), Black: 303#(and (= ~result_10~0 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0) (= |thread3Thread1of1ForFork0_#t~ite23| 0)), Black: 315#(and (= ~result_10~0 0) (= ~result_11~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 301#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0)), Black: 309#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite16| 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0)), 284#true, Black: 307#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0)), Black: 271#(and (<= (+ ~result_9~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0)), Black: 269#(and (<= (+ ~result_9~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite9| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0)), Black: 267#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite9| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0)), Black: 263#(<= (+ ~result_9~0 1) 0), Black: 261#(<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0), 334#(not (= (* 256 (div ~is_null_6~0 256)) ~is_null_6~0)), 93#L77-4true, Black: 249#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 89#thread1ENTRYtrue, Black: 299#(and (= ~result_10~0 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0))]) [2021-11-02 22:07:47,053 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2021-11-02 22:07:47,053 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-11-02 22:07:47,054 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2021-11-02 22:07:47,054 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-11-02 22:07:47,065 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([748] L56-27-->L56-28: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork0_#t~ite23_5|) InVars {thread3Thread1of1ForFork0_#t~ite23=|v_thread3Thread1of1ForFork0_#t~ite23_5|} OutVars{~result_11~0=v_~result_11~0_1, thread3Thread1of1ForFork0_#t~ite23=|v_thread3Thread1of1ForFork0_#t~ite23_5|} AuxVars[] AssignedVars[~result_11~0][185], [Black: 288#(= ~result_10~0 0), 130#L50-28true, 201#L56-28true, Black: 295#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0)), Black: 253#true, Black: 305#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0) (= |thread3Thread1of1ForFork0_#t~ite23| 0)), Black: 311#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite16| 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0) (= |thread3Thread1of1ForFork0_#t~ite23| 0)), Black: 317#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~result_10~0 0) (= ~result_11~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 297#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite16| 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0)), Black: 291#(and (= ~result_10~0 0) (= ~result_11~0 0)), Black: 303#(and (= ~result_10~0 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0) (= |thread3Thread1of1ForFork0_#t~ite23| 0)), Black: 315#(and (= ~result_10~0 0) (= ~result_11~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 301#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0)), Black: 309#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite16| 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0)), Black: 307#(and (= ~result_10~0 0) (= |thread2Thread1of1ForFork2_#t~ite10| 0)), 284#true, 106#L44-6true, Black: 271#(and (<= (+ ~result_9~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0)), Black: 269#(and (<= (+ ~result_9~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite9| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0)), Black: 267#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite9| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0)), Black: 263#(<= (+ ~result_9~0 1) 0), Black: 261#(<= (+ |thread1Thread1of1ForFork1_#t~ite8| 1) 0), 334#(not (= (* 256 (div ~is_null_6~0 256)) ~is_null_6~0)), 93#L77-4true, Black: 249#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), Black: 299#(and (= ~result_10~0 0) (= ~result_11~0 0) (= |thread3Thread1of1ForFork0_#t~ite17| 0))]) [2021-11-02 22:07:47,065 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is not cut-off event [2021-11-02 22:07:47,065 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-11-02 22:07:47,066 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-11-02 22:07:47,066 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2021-11-02 22:07:47,243 INFO L129 PetriNetUnfolder]: 178/1550 cut-off events. [2021-11-02 22:07:47,244 INFO L130 PetriNetUnfolder]: For 699/758 co-relation queries the response was YES. [2021-11-02 22:07:47,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1550 events. 178/1550 cut-off events. For 699/758 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13908 event pairs, 38 based on Foata normal form. 16/1430 useless extension candidates. Maximal degree in co-relation 2638. Up to 129 conditions per place. [2021-11-02 22:07:47,284 INFO L132 encePairwiseOnDemand]: 252/260 looper letters, 10 selfloop transitions, 4 changer transitions 0/283 dead transitions. [2021-11-02 22:07:47,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 283 transitions, 850 flow [2021-11-02 22:07:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:07:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 22:07:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2021-11-02 22:07:47,289 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.95 [2021-11-02 22:07:47,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2021-11-02 22:07:47,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2021-11-02 22:07:47,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:47,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2021-11-02 22:07:47,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,297 INFO L186 Difference]: Start difference. First operand has 266 places, 279 transitions, 814 flow. Second operand 3 states and 741 transitions. [2021-11-02 22:07:47,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 283 transitions, 850 flow [2021-11-02 22:07:47,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 283 transitions, 846 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-11-02 22:07:47,329 INFO L242 Difference]: Finished difference. Result has 266 places, 283 transitions, 850 flow [2021-11-02 22:07:47,330 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=266, PETRI_TRANSITIONS=283} [2021-11-02 22:07:47,330 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 35 predicate places. [2021-11-02 22:07:47,331 INFO L470 AbstractCegarLoop]: Abstraction has has 266 places, 283 transitions, 850 flow [2021-11-02 22:07:47,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,332 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:47,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:47,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 22:07:47,332 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1682711887, now seen corresponding path program 2 times [2021-11-02 22:07:47,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:47,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634881194] [2021-11-02 22:07:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:47,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:47,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:47,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634881194] [2021-11-02 22:07:47,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634881194] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:47,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:47,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:47,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650803719] [2021-11-02 22:07:47,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:07:47,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:07:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:07:47,428 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 260 [2021-11-02 22:07:47,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 283 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:47,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 260 [2021-11-02 22:07:47,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:47,740 INFO L129 PetriNetUnfolder]: 126/1144 cut-off events. [2021-11-02 22:07:47,740 INFO L130 PetriNetUnfolder]: For 550/775 co-relation queries the response was YES. [2021-11-02 22:07:47,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 1144 events. 126/1144 cut-off events. For 550/775 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9052 event pairs, 18 based on Foata normal form. 16/1069 useless extension candidates. Maximal degree in co-relation 1864. Up to 71 conditions per place. [2021-11-02 22:07:47,769 INFO L132 encePairwiseOnDemand]: 250/260 looper letters, 12 selfloop transitions, 6 changer transitions 0/287 dead transitions. [2021-11-02 22:07:47,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 902 flow [2021-11-02 22:07:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:07:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 22:07:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2021-11-02 22:07:47,773 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.95 [2021-11-02 22:07:47,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2021-11-02 22:07:47,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2021-11-02 22:07:47,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:47,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2021-11-02 22:07:47,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,782 INFO L186 Difference]: Start difference. First operand has 266 places, 283 transitions, 850 flow. Second operand 3 states and 741 transitions. [2021-11-02 22:07:47,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 902 flow [2021-11-02 22:07:47,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 287 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-02 22:07:47,812 INFO L242 Difference]: Finished difference. Result has 269 places, 287 transitions, 902 flow [2021-11-02 22:07:47,813 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=269, PETRI_TRANSITIONS=287} [2021-11-02 22:07:47,813 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 38 predicate places. [2021-11-02 22:07:47,813 INFO L470 AbstractCegarLoop]: Abstraction has has 269 places, 287 transitions, 902 flow [2021-11-02 22:07:47,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:47,814 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:47,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:47,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 22:07:47,815 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1960891435, now seen corresponding path program 1 times [2021-11-02 22:07:47,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:47,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933528704] [2021-11-02 22:07:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:47,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:48,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:48,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933528704] [2021-11-02 22:07:48,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933528704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:48,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:48,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:07:48,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645742949] [2021-11-02 22:07:48,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:07:48,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:48,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:07:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:07:48,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:07:48,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 287 transitions, 902 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:48,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:48,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:07:48,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:49,039 INFO L129 PetriNetUnfolder]: 412/2110 cut-off events. [2021-11-02 22:07:49,040 INFO L130 PetriNetUnfolder]: For 1432/1575 co-relation queries the response was YES. [2021-11-02 22:07:49,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4595 conditions, 2110 events. 412/2110 cut-off events. For 1432/1575 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 18848 event pairs, 134 based on Foata normal form. 1/1957 useless extension candidates. Maximal degree in co-relation 4447. Up to 610 conditions per place. [2021-11-02 22:07:49,097 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 82 selfloop transitions, 28 changer transitions 7/344 dead transitions. [2021-11-02 22:07:49,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 344 transitions, 1455 flow [2021-11-02 22:07:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 22:07:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-11-02 22:07:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3870 transitions. [2021-11-02 22:07:49,112 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8755656108597285 [2021-11-02 22:07:49,112 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3870 transitions. [2021-11-02 22:07:49,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3870 transitions. [2021-11-02 22:07:49,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:49,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3870 transitions. [2021-11-02 22:07:49,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 227.64705882352942) internal successors, (3870), 17 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:49,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:49,149 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:49,150 INFO L186 Difference]: Start difference. First operand has 269 places, 287 transitions, 902 flow. Second operand 17 states and 3870 transitions. [2021-11-02 22:07:49,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 344 transitions, 1455 flow [2021-11-02 22:07:49,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 344 transitions, 1435 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-11-02 22:07:49,185 INFO L242 Difference]: Finished difference. Result has 295 places, 315 transitions, 1194 flow [2021-11-02 22:07:49,186 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1194, PETRI_PLACES=295, PETRI_TRANSITIONS=315} [2021-11-02 22:07:49,186 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 64 predicate places. [2021-11-02 22:07:49,186 INFO L470 AbstractCegarLoop]: Abstraction has has 295 places, 315 transitions, 1194 flow [2021-11-02 22:07:49,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:49,188 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:49,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:49,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 22:07:49,189 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash -991008819, now seen corresponding path program 1 times [2021-11-02 22:07:49,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:49,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061406055] [2021-11-02 22:07:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:49,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:49,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:49,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061406055] [2021-11-02 22:07:49,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061406055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:49,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:49,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:49,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586753576] [2021-11-02 22:07:49,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:07:49,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:07:49,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:07:49,340 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 260 [2021-11-02 22:07:49,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 315 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:49,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:49,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 260 [2021-11-02 22:07:49,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:50,149 INFO L129 PetriNetUnfolder]: 285/2775 cut-off events. [2021-11-02 22:07:50,150 INFO L130 PetriNetUnfolder]: For 3612/3769 co-relation queries the response was YES. [2021-11-02 22:07:50,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5428 conditions, 2775 events. 285/2775 cut-off events. For 3612/3769 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 29851 event pairs, 62 based on Foata normal form. 14/2583 useless extension candidates. Maximal degree in co-relation 5377. Up to 161 conditions per place. [2021-11-02 22:07:50,286 INFO L132 encePairwiseOnDemand]: 252/260 looper letters, 6 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2021-11-02 22:07:50,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 318 transitions, 1222 flow [2021-11-02 22:07:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:07:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 22:07:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 743 transitions. [2021-11-02 22:07:50,291 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9525641025641025 [2021-11-02 22:07:50,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 743 transitions. [2021-11-02 22:07:50,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 743 transitions. [2021-11-02 22:07:50,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:50,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 743 transitions. [2021-11-02 22:07:50,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:50,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:50,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:50,300 INFO L186 Difference]: Start difference. First operand has 295 places, 315 transitions, 1194 flow. Second operand 3 states and 743 transitions. [2021-11-02 22:07:50,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 318 transitions, 1222 flow [2021-11-02 22:07:50,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 318 transitions, 1120 flow, removed 51 selfloop flow, removed 2 redundant places. [2021-11-02 22:07:50,392 INFO L242 Difference]: Finished difference. Result has 295 places, 318 transitions, 1130 flow [2021-11-02 22:07:50,393 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=295, PETRI_TRANSITIONS=318} [2021-11-02 22:07:50,393 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 64 predicate places. [2021-11-02 22:07:50,393 INFO L470 AbstractCegarLoop]: Abstraction has has 295 places, 318 transitions, 1130 flow [2021-11-02 22:07:50,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:50,394 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:50,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:50,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 22:07:50,395 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1915209215, now seen corresponding path program 2 times [2021-11-02 22:07:50,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:50,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784184079] [2021-11-02 22:07:50,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:50,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:50,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:50,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784184079] [2021-11-02 22:07:50,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784184079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:50,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:50,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:07:50,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090687808] [2021-11-02 22:07:50,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:07:50,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:07:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:07:50,454 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 260 [2021-11-02 22:07:50,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 318 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:50,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:50,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 260 [2021-11-02 22:07:50,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:51,141 INFO L129 PetriNetUnfolder]: 303/2589 cut-off events. [2021-11-02 22:07:51,142 INFO L130 PetriNetUnfolder]: For 3420/3605 co-relation queries the response was YES. [2021-11-02 22:07:51,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5318 conditions, 2589 events. 303/2589 cut-off events. For 3420/3605 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 27232 event pairs, 66 based on Foata normal form. 19/2454 useless extension candidates. Maximal degree in co-relation 5178. Up to 174 conditions per place. [2021-11-02 22:07:51,190 INFO L132 encePairwiseOnDemand]: 254/260 looper letters, 11 selfloop transitions, 3 changer transitions 0/321 dead transitions. [2021-11-02 22:07:51,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 321 transitions, 1170 flow [2021-11-02 22:07:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:07:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 22:07:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 743 transitions. [2021-11-02 22:07:51,195 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9525641025641025 [2021-11-02 22:07:51,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 743 transitions. [2021-11-02 22:07:51,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 743 transitions. [2021-11-02 22:07:51,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:51,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 743 transitions. [2021-11-02 22:07:51,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:51,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:51,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:51,203 INFO L186 Difference]: Start difference. First operand has 295 places, 318 transitions, 1130 flow. Second operand 3 states and 743 transitions. [2021-11-02 22:07:51,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 321 transitions, 1170 flow [2021-11-02 22:07:51,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 321 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-02 22:07:51,266 INFO L242 Difference]: Finished difference. Result has 297 places, 321 transitions, 1156 flow [2021-11-02 22:07:51,267 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=297, PETRI_TRANSITIONS=321} [2021-11-02 22:07:51,267 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 66 predicate places. [2021-11-02 22:07:51,268 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 321 transitions, 1156 flow [2021-11-02 22:07:51,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:51,268 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:51,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:51,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 22:07:51,269 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1376816679, now seen corresponding path program 2 times [2021-11-02 22:07:51,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:51,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671143641] [2021-11-02 22:07:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:51,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:51,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:51,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671143641] [2021-11-02 22:07:51,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671143641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:51,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:51,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:07:51,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441736271] [2021-11-02 22:07:51,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:07:51,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:51,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:07:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:07:51,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:07:51,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 321 transitions, 1156 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:51,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:51,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:07:51,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:52,822 INFO L129 PetriNetUnfolder]: 700/3753 cut-off events. [2021-11-02 22:07:52,822 INFO L130 PetriNetUnfolder]: For 6099/6217 co-relation queries the response was YES. [2021-11-02 22:07:52,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9709 conditions, 3753 events. 700/3753 cut-off events. For 6099/6217 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 39895 event pairs, 246 based on Foata normal form. 1/3544 useless extension candidates. Maximal degree in co-relation 9546. Up to 1073 conditions per place. [2021-11-02 22:07:52,901 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 108 selfloop transitions, 34 changer transitions 7/382 dead transitions. [2021-11-02 22:07:52,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 382 transitions, 1972 flow [2021-11-02 22:07:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-02 22:07:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-11-02 22:07:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4545 transitions. [2021-11-02 22:07:52,921 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8740384615384615 [2021-11-02 22:07:52,921 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4545 transitions. [2021-11-02 22:07:52,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4545 transitions. [2021-11-02 22:07:52,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:52,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4545 transitions. [2021-11-02 22:07:52,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 227.25) internal successors, (4545), 20 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:52,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 260.0) internal successors, (5460), 21 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:52,959 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 260.0) internal successors, (5460), 21 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:52,960 INFO L186 Difference]: Start difference. First operand has 297 places, 321 transitions, 1156 flow. Second operand 20 states and 4545 transitions. [2021-11-02 22:07:52,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 382 transitions, 1972 flow [2021-11-02 22:07:53,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 382 transitions, 1963 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-11-02 22:07:53,088 INFO L242 Difference]: Finished difference. Result has 330 places, 354 transitions, 1623 flow [2021-11-02 22:07:53,090 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1623, PETRI_PLACES=330, PETRI_TRANSITIONS=354} [2021-11-02 22:07:53,090 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 99 predicate places. [2021-11-02 22:07:53,090 INFO L470 AbstractCegarLoop]: Abstraction has has 330 places, 354 transitions, 1623 flow [2021-11-02 22:07:53,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:53,092 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:53,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:53,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 22:07:53,093 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 889072841, now seen corresponding path program 1 times [2021-11-02 22:07:53,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:53,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057690975] [2021-11-02 22:07:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:53,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:53,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:53,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057690975] [2021-11-02 22:07:53,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057690975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:53,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:53,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 22:07:53,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376178638] [2021-11-02 22:07:53,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:07:53,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:07:53,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:07:53,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 260 [2021-11-02 22:07:53,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 354 transitions, 1623 flow. Second operand has 7 states, 7 states have (on average 234.14285714285714) internal successors, (1639), 7 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:53,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:53,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 260 [2021-11-02 22:07:53,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:54,289 INFO L129 PetriNetUnfolder]: 372/2805 cut-off events. [2021-11-02 22:07:54,290 INFO L130 PetriNetUnfolder]: For 7804/7986 co-relation queries the response was YES. [2021-11-02 22:07:54,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7022 conditions, 2805 events. 372/2805 cut-off events. For 7804/7986 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 29641 event pairs, 75 based on Foata normal form. 14/2643 useless extension candidates. Maximal degree in co-relation 6958. Up to 238 conditions per place. [2021-11-02 22:07:54,350 INFO L132 encePairwiseOnDemand]: 252/260 looper letters, 19 selfloop transitions, 0 changer transitions 9/361 dead transitions. [2021-11-02 22:07:54,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 361 transitions, 1697 flow [2021-11-02 22:07:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:07:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-02 22:07:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2113 transitions. [2021-11-02 22:07:54,359 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.902991452991453 [2021-11-02 22:07:54,360 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2113 transitions. [2021-11-02 22:07:54,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2113 transitions. [2021-11-02 22:07:54,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:54,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2113 transitions. [2021-11-02 22:07:54,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 234.77777777777777) internal successors, (2113), 9 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:54,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:54,378 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:54,378 INFO L186 Difference]: Start difference. First operand has 330 places, 354 transitions, 1623 flow. Second operand 9 states and 2113 transitions. [2021-11-02 22:07:54,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 361 transitions, 1697 flow [2021-11-02 22:07:54,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 361 transitions, 1501 flow, removed 98 selfloop flow, removed 2 redundant places. [2021-11-02 22:07:54,649 INFO L242 Difference]: Finished difference. Result has 341 places, 352 transitions, 1433 flow [2021-11-02 22:07:54,651 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1433, PETRI_PLACES=341, PETRI_TRANSITIONS=352} [2021-11-02 22:07:54,651 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 110 predicate places. [2021-11-02 22:07:54,651 INFO L470 AbstractCegarLoop]: Abstraction has has 341 places, 352 transitions, 1433 flow [2021-11-02 22:07:54,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 234.14285714285714) internal successors, (1639), 7 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:54,652 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:54,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:54,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 22:07:54,653 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1398699535, now seen corresponding path program 3 times [2021-11-02 22:07:54,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:54,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676054196] [2021-11-02 22:07:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:54,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:54,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:54,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676054196] [2021-11-02 22:07:54,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676054196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:54,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:54,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:07:54,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119210717] [2021-11-02 22:07:54,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:07:54,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:54,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:07:54,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:07:54,887 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:07:54,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 352 transitions, 1433 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:54,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:54,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:07:54,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:56,417 INFO L129 PetriNetUnfolder]: 679/3789 cut-off events. [2021-11-02 22:07:56,418 INFO L130 PetriNetUnfolder]: For 9377/9476 co-relation queries the response was YES. [2021-11-02 22:07:56,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 3789 events. 679/3789 cut-off events. For 9377/9476 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 41020 event pairs, 213 based on Foata normal form. 1/3595 useless extension candidates. Maximal degree in co-relation 10421. Up to 911 conditions per place. [2021-11-02 22:07:56,529 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 140 selfloop transitions, 57 changer transitions 7/435 dead transitions. [2021-11-02 22:07:56,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 435 transitions, 2552 flow [2021-11-02 22:07:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 22:07:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-11-02 22:07:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5455 transitions. [2021-11-02 22:07:56,552 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.874198717948718 [2021-11-02 22:07:56,553 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5455 transitions. [2021-11-02 22:07:56,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5455 transitions. [2021-11-02 22:07:56,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:56,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5455 transitions. [2021-11-02 22:07:56,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 227.29166666666666) internal successors, (5455), 24 states have internal predecessors, (5455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:56,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 260.0) internal successors, (6500), 25 states have internal predecessors, (6500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:56,604 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 260.0) internal successors, (6500), 25 states have internal predecessors, (6500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:56,604 INFO L186 Difference]: Start difference. First operand has 341 places, 352 transitions, 1433 flow. Second operand 24 states and 5455 transitions. [2021-11-02 22:07:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 435 transitions, 2552 flow [2021-11-02 22:07:56,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 435 transitions, 2526 flow, removed 13 selfloop flow, removed 7 redundant places. [2021-11-02 22:07:56,807 INFO L242 Difference]: Finished difference. Result has 369 places, 381 transitions, 1978 flow [2021-11-02 22:07:56,808 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1978, PETRI_PLACES=369, PETRI_TRANSITIONS=381} [2021-11-02 22:07:56,808 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 138 predicate places. [2021-11-02 22:07:56,809 INFO L470 AbstractCegarLoop]: Abstraction has has 369 places, 381 transitions, 1978 flow [2021-11-02 22:07:56,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:56,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:56,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:56,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 22:07:56,811 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:56,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -180722813, now seen corresponding path program 4 times [2021-11-02 22:07:56,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:56,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547741160] [2021-11-02 22:07:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:56,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:57,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:57,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547741160] [2021-11-02 22:07:57,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547741160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:57,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:57,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:07:57,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171415175] [2021-11-02 22:07:57,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:07:57,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:07:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:07:57,032 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:07:57,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 381 transitions, 1978 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:57,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:57,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:07:57,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:07:58,521 INFO L129 PetriNetUnfolder]: 717/3747 cut-off events. [2021-11-02 22:07:58,522 INFO L130 PetriNetUnfolder]: For 16791/16916 co-relation queries the response was YES. [2021-11-02 22:07:58,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12432 conditions, 3747 events. 717/3747 cut-off events. For 16791/16916 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 39803 event pairs, 235 based on Foata normal form. 7/3563 useless extension candidates. Maximal degree in co-relation 12361. Up to 1085 conditions per place. [2021-11-02 22:07:58,600 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 138 selfloop transitions, 56 changer transitions 7/432 dead transitions. [2021-11-02 22:07:58,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 432 transitions, 3004 flow [2021-11-02 22:07:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 22:07:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 22:07:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4097 transitions. [2021-11-02 22:07:58,609 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8754273504273504 [2021-11-02 22:07:58,609 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4097 transitions. [2021-11-02 22:07:58,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4097 transitions. [2021-11-02 22:07:58,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:07:58,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4097 transitions. [2021-11-02 22:07:58,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 227.61111111111111) internal successors, (4097), 18 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:58,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:58,635 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:58,635 INFO L186 Difference]: Start difference. First operand has 369 places, 381 transitions, 1978 flow. Second operand 18 states and 4097 transitions. [2021-11-02 22:07:58,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 432 transitions, 3004 flow [2021-11-02 22:07:58,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 432 transitions, 2791 flow, removed 104 selfloop flow, removed 3 redundant places. [2021-11-02 22:07:58,931 INFO L242 Difference]: Finished difference. Result has 390 places, 408 transitions, 2340 flow [2021-11-02 22:07:58,932 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2340, PETRI_PLACES=390, PETRI_TRANSITIONS=408} [2021-11-02 22:07:58,932 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 159 predicate places. [2021-11-02 22:07:58,932 INFO L470 AbstractCegarLoop]: Abstraction has has 390 places, 408 transitions, 2340 flow [2021-11-02 22:07:58,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:58,933 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:07:58,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:07:58,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 22:07:58,934 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:07:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:07:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash -531636885, now seen corresponding path program 5 times [2021-11-02 22:07:58,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:07:58,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402580061] [2021-11-02 22:07:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:07:58,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:07:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:07:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:07:59,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:07:59,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402580061] [2021-11-02 22:07:59,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402580061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:59,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:59,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:07:59,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078879185] [2021-11-02 22:07:59,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:07:59,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:07:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:07:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:07:59,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:07:59,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 408 transitions, 2340 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:07:59,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:07:59,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:07:59,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:00,962 INFO L129 PetriNetUnfolder]: 738/4036 cut-off events. [2021-11-02 22:08:00,962 INFO L130 PetriNetUnfolder]: For 21303/21437 co-relation queries the response was YES. [2021-11-02 22:08:01,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13485 conditions, 4036 events. 738/4036 cut-off events. For 21303/21437 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 44243 event pairs, 210 based on Foata normal form. 1/3845 useless extension candidates. Maximal degree in co-relation 13407. Up to 856 conditions per place. [2021-11-02 22:08:01,040 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 173 selfloop transitions, 94 changer transitions 7/505 dead transitions. [2021-11-02 22:08:01,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 505 transitions, 3894 flow [2021-11-02 22:08:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 22:08:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-11-02 22:08:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5450 transitions. [2021-11-02 22:08:01,060 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8733974358974359 [2021-11-02 22:08:01,060 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5450 transitions. [2021-11-02 22:08:01,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5450 transitions. [2021-11-02 22:08:01,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:01,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5450 transitions. [2021-11-02 22:08:01,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 227.08333333333334) internal successors, (5450), 24 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:01,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 260.0) internal successors, (6500), 25 states have internal predecessors, (6500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:01,093 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 260.0) internal successors, (6500), 25 states have internal predecessors, (6500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:01,094 INFO L186 Difference]: Start difference. First operand has 390 places, 408 transitions, 2340 flow. Second operand 24 states and 5450 transitions. [2021-11-02 22:08:01,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 505 transitions, 3894 flow [2021-11-02 22:08:01,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 505 transitions, 3676 flow, removed 109 selfloop flow, removed 2 redundant places. [2021-11-02 22:08:01,454 INFO L242 Difference]: Finished difference. Result has 429 places, 438 transitions, 2943 flow [2021-11-02 22:08:01,455 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2943, PETRI_PLACES=429, PETRI_TRANSITIONS=438} [2021-11-02 22:08:01,456 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 198 predicate places. [2021-11-02 22:08:01,456 INFO L470 AbstractCegarLoop]: Abstraction has has 429 places, 438 transitions, 2943 flow [2021-11-02 22:08:01,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:01,457 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:01,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:01,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 22:08:01,458 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash 48400893, now seen corresponding path program 6 times [2021-11-02 22:08:01,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:01,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305606227] [2021-11-02 22:08:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:01,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:01,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:01,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305606227] [2021-11-02 22:08:01,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305606227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:01,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:01,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:01,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996868268] [2021-11-02 22:08:01,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:01,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:01,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:01,656 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:01,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 438 transitions, 2943 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:01,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:01,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:01,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:03,607 INFO L129 PetriNetUnfolder]: 765/4269 cut-off events. [2021-11-02 22:08:03,608 INFO L130 PetriNetUnfolder]: For 28160/28294 co-relation queries the response was YES. [2021-11-02 22:08:03,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15534 conditions, 4269 events. 765/4269 cut-off events. For 28160/28294 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 47596 event pairs, 220 based on Foata normal form. 10/4093 useless extension candidates. Maximal degree in co-relation 15437. Up to 1135 conditions per place. [2021-11-02 22:08:03,718 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 174 selfloop transitions, 89 changer transitions 7/501 dead transitions. [2021-11-02 22:08:03,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 501 transitions, 4535 flow [2021-11-02 22:08:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 22:08:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-11-02 22:08:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4995 transitions. [2021-11-02 22:08:03,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8732517482517482 [2021-11-02 22:08:03,732 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4995 transitions. [2021-11-02 22:08:03,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4995 transitions. [2021-11-02 22:08:03,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:03,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4995 transitions. [2021-11-02 22:08:03,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 227.04545454545453) internal successors, (4995), 22 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:03,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 260.0) internal successors, (5980), 23 states have internal predecessors, (5980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:03,765 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 260.0) internal successors, (5980), 23 states have internal predecessors, (5980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:03,765 INFO L186 Difference]: Start difference. First operand has 429 places, 438 transitions, 2943 flow. Second operand 22 states and 4995 transitions. [2021-11-02 22:08:03,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 501 transitions, 4535 flow [2021-11-02 22:08:04,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 501 transitions, 4297 flow, removed 119 selfloop flow, removed 2 redundant places. [2021-11-02 22:08:04,293 INFO L242 Difference]: Finished difference. Result has 460 places, 467 transitions, 3592 flow [2021-11-02 22:08:04,295 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=2795, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3592, PETRI_PLACES=460, PETRI_TRANSITIONS=467} [2021-11-02 22:08:04,295 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 229 predicate places. [2021-11-02 22:08:04,296 INFO L470 AbstractCegarLoop]: Abstraction has has 460 places, 467 transitions, 3592 flow [2021-11-02 22:08:04,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:04,297 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:04,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:04,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 22:08:04,297 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash -846632499, now seen corresponding path program 7 times [2021-11-02 22:08:04,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:04,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931159752] [2021-11-02 22:08:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:04,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:04,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:04,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931159752] [2021-11-02 22:08:04,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931159752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:04,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:04,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:04,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759301413] [2021-11-02 22:08:04,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:04,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:04,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:04,472 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:04,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 467 transitions, 3592 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:04,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:04,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:04,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:06,474 INFO L129 PetriNetUnfolder]: 787/4519 cut-off events. [2021-11-02 22:08:06,474 INFO L130 PetriNetUnfolder]: For 25838/25982 co-relation queries the response was YES. [2021-11-02 22:08:06,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16272 conditions, 4519 events. 787/4519 cut-off events. For 25838/25982 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 51332 event pairs, 249 based on Foata normal form. 1/4313 useless extension candidates. Maximal degree in co-relation 16162. Up to 1184 conditions per place. [2021-11-02 22:08:06,744 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 178 selfloop transitions, 108 changer transitions 7/524 dead transitions. [2021-11-02 22:08:06,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 524 transitions, 5006 flow [2021-11-02 22:08:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-02 22:08:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-11-02 22:08:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4546 transitions. [2021-11-02 22:08:06,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8742307692307693 [2021-11-02 22:08:06,755 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4546 transitions. [2021-11-02 22:08:06,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4546 transitions. [2021-11-02 22:08:06,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:06,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4546 transitions. [2021-11-02 22:08:06,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 227.3) internal successors, (4546), 20 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:06,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 260.0) internal successors, (5460), 21 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:06,781 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 260.0) internal successors, (5460), 21 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:06,783 INFO L186 Difference]: Start difference. First operand has 460 places, 467 transitions, 3592 flow. Second operand 20 states and 4546 transitions. [2021-11-02 22:08:06,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 524 transitions, 5006 flow [2021-11-02 22:08:07,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 524 transitions, 4765 flow, removed 118 selfloop flow, removed 3 redundant places. [2021-11-02 22:08:07,345 INFO L242 Difference]: Finished difference. Result has 487 places, 494 transitions, 4185 flow [2021-11-02 22:08:07,347 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=3371, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4185, PETRI_PLACES=487, PETRI_TRANSITIONS=494} [2021-11-02 22:08:07,347 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 256 predicate places. [2021-11-02 22:08:07,347 INFO L470 AbstractCegarLoop]: Abstraction has has 487 places, 494 transitions, 4185 flow [2021-11-02 22:08:07,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:07,348 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:07,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:07,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 22:08:07,349 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash -831963057, now seen corresponding path program 8 times [2021-11-02 22:08:07,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:07,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206627714] [2021-11-02 22:08:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:07,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:07,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:07,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206627714] [2021-11-02 22:08:07,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206627714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:07,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:07,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:07,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386891792] [2021-11-02 22:08:07,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:07,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:07,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:07,508 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:07,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 494 transitions, 4185 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:07,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:07,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:07,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:09,652 INFO L129 PetriNetUnfolder]: 803/4812 cut-off events. [2021-11-02 22:08:09,652 INFO L130 PetriNetUnfolder]: For 28558/28739 co-relation queries the response was YES. [2021-11-02 22:08:09,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17455 conditions, 4812 events. 803/4812 cut-off events. For 28558/28739 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 56078 event pairs, 220 based on Foata normal form. 16/4613 useless extension candidates. Maximal degree in co-relation 17334. Up to 1203 conditions per place. [2021-11-02 22:08:09,734 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 191 selfloop transitions, 115 changer transitions 7/544 dead transitions. [2021-11-02 22:08:09,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 544 transitions, 5602 flow [2021-11-02 22:08:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 22:08:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-02 22:08:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3644 transitions. [2021-11-02 22:08:09,742 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759615384615385 [2021-11-02 22:08:09,742 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3644 transitions. [2021-11-02 22:08:09,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3644 transitions. [2021-11-02 22:08:09,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:09,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3644 transitions. [2021-11-02 22:08:09,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 227.75) internal successors, (3644), 16 states have internal predecessors, (3644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:09,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 260.0) internal successors, (4420), 17 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:09,762 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 260.0) internal successors, (4420), 17 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:09,762 INFO L186 Difference]: Start difference. First operand has 487 places, 494 transitions, 4185 flow. Second operand 16 states and 3644 transitions. [2021-11-02 22:08:09,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 544 transitions, 5602 flow [2021-11-02 22:08:10,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 544 transitions, 5421 flow, removed 68 selfloop flow, removed 3 redundant places. [2021-11-02 22:08:10,304 INFO L242 Difference]: Finished difference. Result has 505 places, 512 transitions, 4677 flow [2021-11-02 22:08:10,305 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=4055, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4677, PETRI_PLACES=505, PETRI_TRANSITIONS=512} [2021-11-02 22:08:10,305 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 274 predicate places. [2021-11-02 22:08:10,305 INFO L470 AbstractCegarLoop]: Abstraction has has 505 places, 512 transitions, 4677 flow [2021-11-02 22:08:10,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:10,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:10,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, 1, 1, 1, 1, 1, 1, 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-11-02 22:08:10,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 22:08:10,307 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2015332071, now seen corresponding path program 9 times [2021-11-02 22:08:10,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:10,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962748033] [2021-11-02 22:08:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:10,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:10,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:10,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962748033] [2021-11-02 22:08:10,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962748033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:10,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:10,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:10,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347092039] [2021-11-02 22:08:10,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:10,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:10,468 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:10,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 512 transitions, 4677 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:10,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:10,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:10,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:12,221 INFO L129 PetriNetUnfolder]: 793/4643 cut-off events. [2021-11-02 22:08:12,222 INFO L130 PetriNetUnfolder]: For 27523/27721 co-relation queries the response was YES. [2021-11-02 22:08:12,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17481 conditions, 4643 events. 793/4643 cut-off events. For 27523/27721 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 53336 event pairs, 220 based on Foata normal form. 22/4469 useless extension candidates. Maximal degree in co-relation 17354. Up to 1201 conditions per place. [2021-11-02 22:08:12,571 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 193 selfloop transitions, 119 changer transitions 7/550 dead transitions. [2021-11-02 22:08:12,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 550 transitions, 5889 flow [2021-11-02 22:08:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 22:08:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 22:08:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4093 transitions. [2021-11-02 22:08:12,596 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8745726495726496 [2021-11-02 22:08:12,596 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4093 transitions. [2021-11-02 22:08:12,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4093 transitions. [2021-11-02 22:08:12,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:12,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4093 transitions. [2021-11-02 22:08:12,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 227.38888888888889) internal successors, (4093), 18 states have internal predecessors, (4093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:12,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:12,626 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:12,626 INFO L186 Difference]: Start difference. First operand has 505 places, 512 transitions, 4677 flow. Second operand 18 states and 4093 transitions. [2021-11-02 22:08:12,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 550 transitions, 5889 flow [2021-11-02 22:08:13,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 550 transitions, 5727 flow, removed 58 selfloop flow, removed 3 redundant places. [2021-11-02 22:08:13,192 INFO L242 Difference]: Finished difference. Result has 523 places, 521 transitions, 5013 flow [2021-11-02 22:08:13,193 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=4532, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5013, PETRI_PLACES=523, PETRI_TRANSITIONS=521} [2021-11-02 22:08:13,194 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 292 predicate places. [2021-11-02 22:08:13,194 INFO L470 AbstractCegarLoop]: Abstraction has has 523 places, 521 transitions, 5013 flow [2021-11-02 22:08:13,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:13,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:13,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:13,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 22:08:13,195 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:13,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 37094875, now seen corresponding path program 10 times [2021-11-02 22:08:13,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:13,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465682206] [2021-11-02 22:08:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:13,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:13,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:13,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465682206] [2021-11-02 22:08:13,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465682206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:13,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:13,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:13,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75011522] [2021-11-02 22:08:13,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:13,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:13,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:13,350 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:13,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 521 transitions, 5013 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:13,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:13,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:13,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:15,486 INFO L129 PetriNetUnfolder]: 796/4924 cut-off events. [2021-11-02 22:08:15,486 INFO L130 PetriNetUnfolder]: For 29246/29387 co-relation queries the response was YES. [2021-11-02 22:08:15,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18255 conditions, 4924 events. 796/4924 cut-off events. For 29246/29387 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 58104 event pairs, 249 based on Foata normal form. 1/4710 useless extension candidates. Maximal degree in co-relation 18124. Up to 1157 conditions per place. [2021-11-02 22:08:15,641 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 210 selfloop transitions, 110 changer transitions 7/558 dead transitions. [2021-11-02 22:08:15,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 558 transitions, 6292 flow [2021-11-02 22:08:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 22:08:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-11-02 22:08:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4772 transitions. [2021-11-02 22:08:15,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.873992673992674 [2021-11-02 22:08:15,654 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4772 transitions. [2021-11-02 22:08:15,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4772 transitions. [2021-11-02 22:08:15,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:15,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4772 transitions. [2021-11-02 22:08:15,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 227.23809523809524) internal successors, (4772), 21 states have internal predecessors, (4772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:15,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 260.0) internal successors, (5720), 22 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:15,683 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 260.0) internal successors, (5720), 22 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:15,684 INFO L186 Difference]: Start difference. First operand has 523 places, 521 transitions, 5013 flow. Second operand 21 states and 4772 transitions. [2021-11-02 22:08:15,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 558 transitions, 6292 flow [2021-11-02 22:08:16,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 558 transitions, 6063 flow, removed 63 selfloop flow, removed 8 redundant places. [2021-11-02 22:08:16,388 INFO L242 Difference]: Finished difference. Result has 544 places, 541 transitions, 5560 flow [2021-11-02 22:08:16,389 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=4800, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5560, PETRI_PLACES=544, PETRI_TRANSITIONS=541} [2021-11-02 22:08:16,391 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 313 predicate places. [2021-11-02 22:08:16,391 INFO L470 AbstractCegarLoop]: Abstraction has has 544 places, 541 transitions, 5560 flow [2021-11-02 22:08:16,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:16,392 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:16,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:16,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 22:08:16,393 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1027482965, now seen corresponding path program 11 times [2021-11-02 22:08:16,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:16,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734655198] [2021-11-02 22:08:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:16,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:16,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:16,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734655198] [2021-11-02 22:08:16,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734655198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:16,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:16,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:16,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201534776] [2021-11-02 22:08:16,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:16,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:16,586 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:16,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 541 transitions, 5560 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:16,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:16,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:16,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:18,748 INFO L129 PetriNetUnfolder]: 802/5011 cut-off events. [2021-11-02 22:08:18,748 INFO L130 PetriNetUnfolder]: For 31239/31380 co-relation queries the response was YES. [2021-11-02 22:08:18,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19068 conditions, 5011 events. 802/5011 cut-off events. For 31239/31380 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 59570 event pairs, 249 based on Foata normal form. 1/4798 useless extension candidates. Maximal degree in co-relation 18931. Up to 1236 conditions per place. [2021-11-02 22:08:18,951 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 220 selfloop transitions, 112 changer transitions 7/570 dead transitions. [2021-11-02 22:08:18,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 570 transitions, 6703 flow [2021-11-02 22:08:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 22:08:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-11-02 22:08:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3872 transitions. [2021-11-02 22:08:18,958 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8760180995475113 [2021-11-02 22:08:18,958 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3872 transitions. [2021-11-02 22:08:18,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3872 transitions. [2021-11-02 22:08:18,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:18,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3872 transitions. [2021-11-02 22:08:18,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 227.76470588235293) internal successors, (3872), 17 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:18,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:18,975 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:18,976 INFO L186 Difference]: Start difference. First operand has 544 places, 541 transitions, 5560 flow. Second operand 17 states and 3872 transitions. [2021-11-02 22:08:18,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 570 transitions, 6703 flow [2021-11-02 22:08:19,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 570 transitions, 6491 flow, removed 99 selfloop flow, removed 5 redundant places. [2021-11-02 22:08:19,512 INFO L242 Difference]: Finished difference. Result has 559 places, 553 transitions, 5892 flow [2021-11-02 22:08:19,513 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=5376, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5892, PETRI_PLACES=559, PETRI_TRANSITIONS=553} [2021-11-02 22:08:19,514 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 328 predicate places. [2021-11-02 22:08:19,514 INFO L470 AbstractCegarLoop]: Abstraction has has 559 places, 553 transitions, 5892 flow [2021-11-02 22:08:19,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:19,515 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:19,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:19,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 22:08:19,516 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1066868887, now seen corresponding path program 12 times [2021-11-02 22:08:19,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:19,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726458261] [2021-11-02 22:08:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:19,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:19,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:19,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726458261] [2021-11-02 22:08:19,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726458261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:19,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:19,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:19,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982022617] [2021-11-02 22:08:19,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:19,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:19,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:19,666 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:19,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 553 transitions, 5892 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:19,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:19,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:19,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:22,073 INFO L129 PetriNetUnfolder]: 799/5131 cut-off events. [2021-11-02 22:08:22,073 INFO L130 PetriNetUnfolder]: For 31463/31604 co-relation queries the response was YES. [2021-11-02 22:08:22,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19298 conditions, 5131 events. 799/5131 cut-off events. For 31463/31604 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 61702 event pairs, 249 based on Foata normal form. 1/4916 useless extension candidates. Maximal degree in co-relation 19159. Up to 1240 conditions per place. [2021-11-02 22:08:22,192 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 209 selfloop transitions, 130 changer transitions 7/577 dead transitions. [2021-11-02 22:08:22,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 577 transitions, 6930 flow [2021-11-02 22:08:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 22:08:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 22:08:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4095 transitions. [2021-11-02 22:08:22,201 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-11-02 22:08:22,201 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4095 transitions. [2021-11-02 22:08:22,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4095 transitions. [2021-11-02 22:08:22,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:22,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4095 transitions. [2021-11-02 22:08:22,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 227.5) internal successors, (4095), 18 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:22,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:22,222 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:22,222 INFO L186 Difference]: Start difference. First operand has 559 places, 553 transitions, 5892 flow. Second operand 18 states and 4095 transitions. [2021-11-02 22:08:22,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 577 transitions, 6930 flow [2021-11-02 22:08:22,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 6828 flow, removed 26 selfloop flow, removed 3 redundant places. [2021-11-02 22:08:22,785 INFO L242 Difference]: Finished difference. Result has 576 places, 560 transitions, 6247 flow [2021-11-02 22:08:22,787 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=5792, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6247, PETRI_PLACES=576, PETRI_TRANSITIONS=560} [2021-11-02 22:08:22,787 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 345 predicate places. [2021-11-02 22:08:22,787 INFO L470 AbstractCegarLoop]: Abstraction has has 576 places, 560 transitions, 6247 flow [2021-11-02 22:08:22,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:22,788 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:22,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:22,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 22:08:22,789 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1976465215, now seen corresponding path program 13 times [2021-11-02 22:08:22,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:22,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364915835] [2021-11-02 22:08:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:22,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:22,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:22,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364915835] [2021-11-02 22:08:22,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364915835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:22,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:22,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:22,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616765599] [2021-11-02 22:08:22,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:22,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:22,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:22,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:22,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 560 transitions, 6247 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:22,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:22,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:22,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:25,396 INFO L129 PetriNetUnfolder]: 843/5293 cut-off events. [2021-11-02 22:08:25,396 INFO L130 PetriNetUnfolder]: For 37345/37497 co-relation queries the response was YES. [2021-11-02 22:08:25,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21023 conditions, 5293 events. 843/5293 cut-off events. For 37345/37497 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 64209 event pairs, 222 based on Foata normal form. 1/5103 useless extension candidates. Maximal degree in co-relation 20881. Up to 1200 conditions per place. [2021-11-02 22:08:25,531 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 241 selfloop transitions, 143 changer transitions 7/622 dead transitions. [2021-11-02 22:08:25,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 622 transitions, 8046 flow [2021-11-02 22:08:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 22:08:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-11-02 22:08:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4993 transitions. [2021-11-02 22:08:25,551 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8729020979020979 [2021-11-02 22:08:25,551 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4993 transitions. [2021-11-02 22:08:25,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4993 transitions. [2021-11-02 22:08:25,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:25,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4993 transitions. [2021-11-02 22:08:25,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 226.95454545454547) internal successors, (4993), 22 states have internal predecessors, (4993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:25,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 260.0) internal successors, (5980), 23 states have internal predecessors, (5980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:25,570 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 260.0) internal successors, (5980), 23 states have internal predecessors, (5980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:25,571 INFO L186 Difference]: Start difference. First operand has 576 places, 560 transitions, 6247 flow. Second operand 22 states and 4993 transitions. [2021-11-02 22:08:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 622 transitions, 8046 flow [2021-11-02 22:08:26,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 622 transitions, 7888 flow, removed 40 selfloop flow, removed 7 redundant places. [2021-11-02 22:08:26,181 INFO L242 Difference]: Finished difference. Result has 602 places, 593 transitions, 7188 flow [2021-11-02 22:08:26,182 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=6100, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7188, PETRI_PLACES=602, PETRI_TRANSITIONS=593} [2021-11-02 22:08:26,182 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 371 predicate places. [2021-11-02 22:08:26,183 INFO L470 AbstractCegarLoop]: Abstraction has has 602 places, 593 transitions, 7188 flow [2021-11-02 22:08:26,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:26,183 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:26,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:26,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 22:08:26,184 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1458340045, now seen corresponding path program 14 times [2021-11-02 22:08:26,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:26,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954983168] [2021-11-02 22:08:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:26,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:26,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:26,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954983168] [2021-11-02 22:08:26,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954983168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:26,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:26,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:26,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726264632] [2021-11-02 22:08:26,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:26,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:26,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:26,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 593 transitions, 7188 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:26,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:26,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:26,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:28,787 INFO L129 PetriNetUnfolder]: 858/5512 cut-off events. [2021-11-02 22:08:28,787 INFO L130 PetriNetUnfolder]: For 41969/42121 co-relation queries the response was YES. [2021-11-02 22:08:28,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22513 conditions, 5512 events. 858/5512 cut-off events. For 41969/42121 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 67815 event pairs, 225 based on Foata normal form. 1/5322 useless extension candidates. Maximal degree in co-relation 22363. Up to 1216 conditions per place. [2021-11-02 22:08:28,936 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 295 selfloop transitions, 106 changer transitions 7/639 dead transitions. [2021-11-02 22:08:28,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 639 transitions, 8885 flow [2021-11-02 22:08:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 22:08:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-11-02 22:08:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4771 transitions. [2021-11-02 22:08:28,949 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2021-11-02 22:08:28,949 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4771 transitions. [2021-11-02 22:08:28,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4771 transitions. [2021-11-02 22:08:28,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:28,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4771 transitions. [2021-11-02 22:08:28,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 227.1904761904762) internal successors, (4771), 21 states have internal predecessors, (4771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:28,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 260.0) internal successors, (5720), 22 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:28,968 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 260.0) internal successors, (5720), 22 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:28,968 INFO L186 Difference]: Start difference. First operand has 602 places, 593 transitions, 7188 flow. Second operand 21 states and 4771 transitions. [2021-11-02 22:08:28,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 639 transitions, 8885 flow [2021-11-02 22:08:29,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 639 transitions, 8663 flow, removed 111 selfloop flow, removed 2 redundant places. [2021-11-02 22:08:29,645 INFO L242 Difference]: Finished difference. Result has 632 places, 618 transitions, 7878 flow [2021-11-02 22:08:29,647 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=6980, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=7878, PETRI_PLACES=632, PETRI_TRANSITIONS=618} [2021-11-02 22:08:29,647 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 401 predicate places. [2021-11-02 22:08:29,647 INFO L470 AbstractCegarLoop]: Abstraction has has 632 places, 618 transitions, 7878 flow [2021-11-02 22:08:29,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:29,648 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:29,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:29,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 22:08:29,649 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1205438305, now seen corresponding path program 15 times [2021-11-02 22:08:29,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:29,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310134985] [2021-11-02 22:08:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:29,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:29,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:29,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310134985] [2021-11-02 22:08:29,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310134985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:29,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:29,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:29,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50199174] [2021-11-02 22:08:29,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:29,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:29,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:29,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:29,815 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:29,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 618 transitions, 7878 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:29,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:29,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:29,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:32,920 INFO L129 PetriNetUnfolder]: 867/5644 cut-off events. [2021-11-02 22:08:32,922 INFO L130 PetriNetUnfolder]: For 45555/45707 co-relation queries the response was YES. [2021-11-02 22:08:33,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23435 conditions, 5644 events. 867/5644 cut-off events. For 45555/45707 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 69977 event pairs, 219 based on Foata normal form. 1/5454 useless extension candidates. Maximal degree in co-relation 23272. Up to 1262 conditions per place. [2021-11-02 22:08:33,068 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 263 selfloop transitions, 161 changer transitions 7/662 dead transitions. [2021-11-02 22:08:33,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 662 transitions, 9479 flow [2021-11-02 22:08:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 22:08:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 22:08:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4091 transitions. [2021-11-02 22:08:33,074 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8741452991452991 [2021-11-02 22:08:33,074 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4091 transitions. [2021-11-02 22:08:33,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4091 transitions. [2021-11-02 22:08:33,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:33,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4091 transitions. [2021-11-02 22:08:33,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 227.27777777777777) internal successors, (4091), 18 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:33,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:33,090 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:33,090 INFO L186 Difference]: Start difference. First operand has 632 places, 618 transitions, 7878 flow. Second operand 18 states and 4091 transitions. [2021-11-02 22:08:33,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 662 transitions, 9479 flow [2021-11-02 22:08:33,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 662 transitions, 9257 flow, removed 111 selfloop flow, removed 2 redundant places. [2021-11-02 22:08:33,835 INFO L242 Difference]: Finished difference. Result has 653 places, 640 transitions, 8549 flow [2021-11-02 22:08:33,836 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=7658, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8549, PETRI_PLACES=653, PETRI_TRANSITIONS=640} [2021-11-02 22:08:33,836 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 422 predicate places. [2021-11-02 22:08:33,837 INFO L470 AbstractCegarLoop]: Abstraction has has 653 places, 640 transitions, 8549 flow [2021-11-02 22:08:33,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:33,837 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:33,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:33,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 22:08:33,838 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1216993235, now seen corresponding path program 16 times [2021-11-02 22:08:33,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:33,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990162493] [2021-11-02 22:08:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:33,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:33,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:33,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990162493] [2021-11-02 22:08:33,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990162493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:33,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:33,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:33,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975232029] [2021-11-02 22:08:33,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:33,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:33,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:33,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 640 transitions, 8549 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:33,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:33,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:33,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:36,578 INFO L129 PetriNetUnfolder]: 894/5929 cut-off events. [2021-11-02 22:08:36,578 INFO L130 PetriNetUnfolder]: For 49107/49259 co-relation queries the response was YES. [2021-11-02 22:08:37,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25041 conditions, 5929 events. 894/5929 cut-off events. For 49107/49259 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 74850 event pairs, 219 based on Foata normal form. 1/5739 useless extension candidates. Maximal degree in co-relation 24871. Up to 1290 conditions per place. [2021-11-02 22:08:37,131 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 307 selfloop transitions, 135 changer transitions 7/680 dead transitions. [2021-11-02 22:08:37,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 680 transitions, 10189 flow [2021-11-02 22:08:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 22:08:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-11-02 22:08:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3869 transitions. [2021-11-02 22:08:37,141 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8753393665158371 [2021-11-02 22:08:37,141 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3869 transitions. [2021-11-02 22:08:37,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3869 transitions. [2021-11-02 22:08:37,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:37,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3869 transitions. [2021-11-02 22:08:37,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 227.58823529411765) internal successors, (3869), 17 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:37,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:37,155 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:37,155 INFO L186 Difference]: Start difference. First operand has 653 places, 640 transitions, 8549 flow. Second operand 17 states and 3869 transitions. [2021-11-02 22:08:37,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 680 transitions, 10189 flow [2021-11-02 22:08:38,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 680 transitions, 9941 flow, removed 124 selfloop flow, removed 2 redundant places. [2021-11-02 22:08:38,019 INFO L242 Difference]: Finished difference. Result has 673 places, 662 transitions, 9192 flow [2021-11-02 22:08:38,020 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=8347, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9192, PETRI_PLACES=673, PETRI_TRANSITIONS=662} [2021-11-02 22:08:38,020 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 442 predicate places. [2021-11-02 22:08:38,020 INFO L470 AbstractCegarLoop]: Abstraction has has 673 places, 662 transitions, 9192 flow [2021-11-02 22:08:38,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:38,021 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:38,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:38,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 22:08:38,021 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:38,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1124671155, now seen corresponding path program 17 times [2021-11-02 22:08:38,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:38,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097049005] [2021-11-02 22:08:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:38,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:38,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:38,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097049005] [2021-11-02 22:08:38,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097049005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:38,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:38,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:38,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188801730] [2021-11-02 22:08:38,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:38,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:38,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:38,155 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:38,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 662 transitions, 9192 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:38,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:38,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:38,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:41,200 INFO L129 PetriNetUnfolder]: 909/6202 cut-off events. [2021-11-02 22:08:41,200 INFO L130 PetriNetUnfolder]: For 51445/51597 co-relation queries the response was YES. [2021-11-02 22:08:41,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26281 conditions, 6202 events. 909/6202 cut-off events. For 51445/51597 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 79497 event pairs, 219 based on Foata normal form. 1/6012 useless extension candidates. Maximal degree in co-relation 26104. Up to 1321 conditions per place. [2021-11-02 22:08:41,453 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 332 selfloop transitions, 129 changer transitions 7/699 dead transitions. [2021-11-02 22:08:41,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 699 transitions, 10832 flow [2021-11-02 22:08:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 22:08:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-11-02 22:08:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3871 transitions. [2021-11-02 22:08:41,459 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8757918552036199 [2021-11-02 22:08:41,459 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3871 transitions. [2021-11-02 22:08:41,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3871 transitions. [2021-11-02 22:08:41,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:41,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3871 transitions. [2021-11-02 22:08:41,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 227.7058823529412) internal successors, (3871), 17 states have internal predecessors, (3871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:41,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:41,469 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:41,470 INFO L186 Difference]: Start difference. First operand has 673 places, 662 transitions, 9192 flow. Second operand 17 states and 3871 transitions. [2021-11-02 22:08:41,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 699 transitions, 10832 flow [2021-11-02 22:08:42,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 699 transitions, 10674 flow, removed 79 selfloop flow, removed 2 redundant places. [2021-11-02 22:08:42,728 INFO L242 Difference]: Finished difference. Result has 691 places, 683 transitions, 9859 flow [2021-11-02 22:08:42,730 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=9040, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9859, PETRI_PLACES=691, PETRI_TRANSITIONS=683} [2021-11-02 22:08:42,730 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 460 predicate places. [2021-11-02 22:08:42,730 INFO L470 AbstractCegarLoop]: Abstraction has has 691 places, 683 transitions, 9859 flow [2021-11-02 22:08:42,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:42,731 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:42,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:42,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-02 22:08:42,732 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:42,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1052158559, now seen corresponding path program 18 times [2021-11-02 22:08:42,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:42,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262593724] [2021-11-02 22:08:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:42,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:42,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:42,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262593724] [2021-11-02 22:08:42,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262593724] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:42,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:42,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:42,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709958826] [2021-11-02 22:08:42,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:42,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:42,871 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:42,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 683 transitions, 9859 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:42,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:42,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:42,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:45,893 INFO L129 PetriNetUnfolder]: 909/6154 cut-off events. [2021-11-02 22:08:45,893 INFO L130 PetriNetUnfolder]: For 53639/53791 co-relation queries the response was YES. [2021-11-02 22:08:46,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26742 conditions, 6154 events. 909/6154 cut-off events. For 53639/53791 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 78471 event pairs, 219 based on Foata normal form. 1/5964 useless extension candidates. Maximal degree in co-relation 26560. Up to 1325 conditions per place. [2021-11-02 22:08:46,112 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 335 selfloop transitions, 134 changer transitions 7/707 dead transitions. [2021-11-02 22:08:46,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 707 transitions, 11223 flow [2021-11-02 22:08:46,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 22:08:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 22:08:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4096 transitions. [2021-11-02 22:08:46,117 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8752136752136752 [2021-11-02 22:08:46,117 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4096 transitions. [2021-11-02 22:08:46,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4096 transitions. [2021-11-02 22:08:46,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:46,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4096 transitions. [2021-11-02 22:08:46,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 227.55555555555554) internal successors, (4096), 18 states have internal predecessors, (4096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:46,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:46,129 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:46,129 INFO L186 Difference]: Start difference. First operand has 691 places, 683 transitions, 9859 flow. Second operand 18 states and 4096 transitions. [2021-11-02 22:08:46,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 707 transitions, 11223 flow [2021-11-02 22:08:47,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 707 transitions, 10970 flow, removed 91 selfloop flow, removed 3 redundant places. [2021-11-02 22:08:47,102 INFO L242 Difference]: Finished difference. Result has 708 places, 693 transitions, 10186 flow [2021-11-02 22:08:47,103 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=9628, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10186, PETRI_PLACES=708, PETRI_TRANSITIONS=693} [2021-11-02 22:08:47,104 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 477 predicate places. [2021-11-02 22:08:47,104 INFO L470 AbstractCegarLoop]: Abstraction has has 708 places, 693 transitions, 10186 flow [2021-11-02 22:08:47,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:47,105 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:47,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:47,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-02 22:08:47,106 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1246804625, now seen corresponding path program 19 times [2021-11-02 22:08:47,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:47,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255849646] [2021-11-02 22:08:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:47,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:47,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:47,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255849646] [2021-11-02 22:08:47,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255849646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:47,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:47,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:47,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59309318] [2021-11-02 22:08:47,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:47,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:47,517 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:47,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 693 transitions, 10186 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:47,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:47,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:47,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:50,626 INFO L129 PetriNetUnfolder]: 906/6355 cut-off events. [2021-11-02 22:08:50,627 INFO L130 PetriNetUnfolder]: For 56241/56393 co-relation queries the response was YES. [2021-11-02 22:08:50,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27099 conditions, 6355 events. 906/6355 cut-off events. For 56241/56393 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 82267 event pairs, 219 based on Foata normal form. 1/6165 useless extension candidates. Maximal degree in co-relation 26914. Up to 1341 conditions per place. [2021-11-02 22:08:50,910 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 297 selfloop transitions, 183 changer transitions 7/718 dead transitions. [2021-11-02 22:08:50,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 718 transitions, 11473 flow [2021-11-02 22:08:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 22:08:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-02 22:08:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3642 transitions. [2021-11-02 22:08:50,915 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8754807692307692 [2021-11-02 22:08:50,915 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3642 transitions. [2021-11-02 22:08:50,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3642 transitions. [2021-11-02 22:08:50,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:50,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3642 transitions. [2021-11-02 22:08:50,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 227.625) internal successors, (3642), 16 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:50,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 260.0) internal successors, (4420), 17 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:50,927 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 260.0) internal successors, (4420), 17 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:50,927 INFO L186 Difference]: Start difference. First operand has 708 places, 693 transitions, 10186 flow. Second operand 16 states and 3642 transitions. [2021-11-02 22:08:50,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 718 transitions, 11473 flow [2021-11-02 22:08:51,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 718 transitions, 11322 flow, removed 59 selfloop flow, removed 10 redundant places. [2021-11-02 22:08:51,970 INFO L242 Difference]: Finished difference. Result has 716 places, 699 transitions, 10561 flow [2021-11-02 22:08:51,971 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=10039, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10561, PETRI_PLACES=716, PETRI_TRANSITIONS=699} [2021-11-02 22:08:51,972 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 485 predicate places. [2021-11-02 22:08:51,972 INFO L470 AbstractCegarLoop]: Abstraction has has 716 places, 699 transitions, 10561 flow [2021-11-02 22:08:51,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:51,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:51,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:51,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-02 22:08:51,973 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:51,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1714864459, now seen corresponding path program 20 times [2021-11-02 22:08:51,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:51,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93109314] [2021-11-02 22:08:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:51,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:52,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:52,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93109314] [2021-11-02 22:08:52,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93109314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:52,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:52,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:52,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574048347] [2021-11-02 22:08:52,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:52,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:52,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:52,129 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:52,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 699 transitions, 10561 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:52,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:52,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:52,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:55,748 INFO L129 PetriNetUnfolder]: 906/6368 cut-off events. [2021-11-02 22:08:55,749 INFO L130 PetriNetUnfolder]: For 59281/59433 co-relation queries the response was YES. [2021-11-02 22:08:56,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27569 conditions, 6368 events. 906/6368 cut-off events. For 59281/59433 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 82456 event pairs, 219 based on Foata normal form. 1/6178 useless extension candidates. Maximal degree in co-relation 27388. Up to 1337 conditions per place. [2021-11-02 22:08:56,018 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 328 selfloop transitions, 152 changer transitions 11/718 dead transitions. [2021-11-02 22:08:56,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 718 transitions, 11839 flow [2021-11-02 22:08:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 22:08:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 22:08:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4094 transitions. [2021-11-02 22:08:56,022 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8747863247863248 [2021-11-02 22:08:56,022 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4094 transitions. [2021-11-02 22:08:56,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4094 transitions. [2021-11-02 22:08:56,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:56,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4094 transitions. [2021-11-02 22:08:56,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 227.44444444444446) internal successors, (4094), 18 states have internal predecessors, (4094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:56,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:56,033 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 260.0) internal successors, (4940), 19 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:56,033 INFO L186 Difference]: Start difference. First operand has 716 places, 699 transitions, 10561 flow. Second operand 18 states and 4094 transitions. [2021-11-02 22:08:56,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 718 transitions, 11839 flow [2021-11-02 22:08:57,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 718 transitions, 11539 flow, removed 31 selfloop flow, removed 5 redundant places. [2021-11-02 22:08:57,039 INFO L242 Difference]: Finished difference. Result has 731 places, 702 transitions, 10779 flow [2021-11-02 22:08:57,040 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=10273, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10779, PETRI_PLACES=731, PETRI_TRANSITIONS=702} [2021-11-02 22:08:57,041 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 500 predicate places. [2021-11-02 22:08:57,041 INFO L470 AbstractCegarLoop]: Abstraction has has 731 places, 702 transitions, 10779 flow [2021-11-02 22:08:57,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:57,042 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:57,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:57,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-02 22:08:57,043 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1195158162, now seen corresponding path program 1 times [2021-11-02 22:08:57,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:57,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166824342] [2021-11-02 22:08:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:57,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:57,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:57,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166824342] [2021-11-02 22:08:57,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166824342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:57,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:57,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 22:08:57,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778670440] [2021-11-02 22:08:57,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:08:57,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:08:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:08:57,144 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 260 [2021-11-02 22:08:57,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 702 transitions, 10779 flow. Second operand has 9 states, 9 states have (on average 228.11111111111111) internal successors, (2053), 9 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:57,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:57,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 260 [2021-11-02 22:08:57,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 22:08:58,995 INFO L129 PetriNetUnfolder]: 476/4011 cut-off events. [2021-11-02 22:08:58,996 INFO L130 PetriNetUnfolder]: For 38721/39034 co-relation queries the response was YES. [2021-11-02 22:08:59,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16404 conditions, 4011 events. 476/4011 cut-off events. For 38721/39034 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 48820 event pairs, 56 based on Foata normal form. 6/3882 useless extension candidates. Maximal degree in co-relation 16220. Up to 267 conditions per place. [2021-11-02 22:08:59,102 INFO L132 encePairwiseOnDemand]: 247/260 looper letters, 22 selfloop transitions, 14 changer transitions 3/715 dead transitions. [2021-11-02 22:08:59,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 715 transitions, 10893 flow [2021-11-02 22:08:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 22:08:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-11-02 22:08:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3882 transitions. [2021-11-02 22:08:59,105 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8782805429864253 [2021-11-02 22:08:59,105 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3882 transitions. [2021-11-02 22:08:59,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3882 transitions. [2021-11-02 22:08:59,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:08:59,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3882 transitions. [2021-11-02 22:08:59,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 228.35294117647058) internal successors, (3882), 17 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:59,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:59,116 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 260.0) internal successors, (4680), 18 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:59,116 INFO L186 Difference]: Start difference. First operand has 731 places, 702 transitions, 10779 flow. Second operand 17 states and 3882 transitions. [2021-11-02 22:08:59,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 715 transitions, 10893 flow [2021-11-02 22:08:59,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 715 transitions, 10602 flow, removed 73 selfloop flow, removed 27 redundant places. [2021-11-02 22:08:59,823 INFO L242 Difference]: Finished difference. Result has 727 places, 710 transitions, 10580 flow [2021-11-02 22:08:59,824 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=10488, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10580, PETRI_PLACES=727, PETRI_TRANSITIONS=710} [2021-11-02 22:08:59,824 INFO L334 CegarLoopForPetriNet]: 231 programPoint places, 496 predicate places. [2021-11-02 22:08:59,824 INFO L470 AbstractCegarLoop]: Abstraction has has 727 places, 710 transitions, 10580 flow [2021-11-02 22:08:59,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 228.11111111111111) internal successors, (2053), 9 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:59,825 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 22:08:59,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:59,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-02 22:08:59,826 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-02 22:08:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash -896617214, now seen corresponding path program 1 times [2021-11-02 22:08:59,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:08:59,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628220522] [2021-11-02 22:08:59,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:59,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:08:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:08:59,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:08:59,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628220522] [2021-11-02 22:08:59,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628220522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:08:59,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:08:59,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:08:59,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107455255] [2021-11-02 22:08:59,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:08:59,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:08:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:08:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:08:59,971 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 260 [2021-11-02 22:08:59,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 710 transitions, 10580 flow. Second operand has 10 states, 10 states have (on average 225.2) internal successors, (2252), 10 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:08:59,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 22:08:59,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 260 [2021-11-02 22:08:59,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand