./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/stack_longest-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc --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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:58:17,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:58:17,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:58:17,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:58:17,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:58:17,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:58:17,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:58:17,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:58:17,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:58:17,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:58:17,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:58:17,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:58:17,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:58:17,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:58:17,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:58:17,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:58:17,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:58:17,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:58:17,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:58:17,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:58:17,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:58:17,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:58:17,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:58:17,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:58:17,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:58:17,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:58:17,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:58:17,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:58:17,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:58:17,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:58:17,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:58:17,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:58:17,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:58:17,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:58:17,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:58:17,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:58:17,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:58:17,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:58:17,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:58:17,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:58:17,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:58:17,957 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:58:17,980 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:58:17,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:58:17,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:58:17,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:58:17,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:58:17,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:58:17,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:58:17,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:58:17,987 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:58:17,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:58:17,987 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:58:17,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:58:17,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:58:17,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:58:17,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:58:17,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:58:17,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:58:17,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:58:17,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:58:17,989 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:58:17,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:58:17,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:58:17,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:58:17,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:58:17,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:17,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:58:17,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:58:17,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:58:17,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:58:17,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:58:17,991 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:58:17,991 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:58:17,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:58:17,991 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_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/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_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2022-11-02 20:58:18,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:58:18,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:58:18,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:58:18,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:58:18,384 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:58:18,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread/stack_longest-1.i [2022-11-02 20:58:18,448 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/data/553b7cee6/aabbd8fd2c264d3e8dca6198f04ae780/FLAGc2a83810e [2022-11-02 20:58:19,140 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:58:19,140 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/sv-benchmarks/c/pthread/stack_longest-1.i [2022-11-02 20:58:19,165 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/data/553b7cee6/aabbd8fd2c264d3e8dca6198f04ae780/FLAGc2a83810e [2022-11-02 20:58:19,370 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/data/553b7cee6/aabbd8fd2c264d3e8dca6198f04ae780 [2022-11-02 20:58:19,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:58:19,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:58:19,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:19,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:58:19,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:58:19,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:19" (1/1) ... [2022-11-02 20:58:19,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5b0393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:19, skipping insertion in model container [2022-11-02 20:58:19,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:19" (1/1) ... [2022-11-02 20:58:19,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:58:19,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:58:19,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/sv-benchmarks/c/pthread/stack_longest-1.i[41530,41543] [2022-11-02 20:58:19,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:19,945 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:58:19,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/sv-benchmarks/c/pthread/stack_longest-1.i[41530,41543] [2022-11-02 20:58:20,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:20,092 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:58:20,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20 WrapperNode [2022-11-02 20:58:20,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:20,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:20,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:58:20,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:58:20,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,156 INFO L138 Inliner]: procedures = 277, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 157 [2022-11-02 20:58:20,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:20,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:58:20,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:58:20,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:58:20,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,193 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:58:20,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:58:20,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:58:20,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:58:20,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (1/1) ... [2022-11-02 20:58:20,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:20,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:20,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:58:20,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:58:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-02 20:58:20,303 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-02 20:58:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-02 20:58:20,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-02 20:58:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:58:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:58:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:58:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:58:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:58:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:58:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:58:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:58:20,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:58:20,310 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:58:20,548 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:58:20,550 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:58:20,821 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:58:20,829 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:58:20,830 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:58:20,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:20 BoogieIcfgContainer [2022-11-02 20:58:20,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:58:20,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:58:20,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:58:20,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:58:20,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:58:19" (1/3) ... [2022-11-02 20:58:20,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b69cf61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:20, skipping insertion in model container [2022-11-02 20:58:20,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:20" (2/3) ... [2022-11-02 20:58:20,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b69cf61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:20, skipping insertion in model container [2022-11-02 20:58:20,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:20" (3/3) ... [2022-11-02 20:58:20,849 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2022-11-02 20:58:20,859 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:58:20,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:58:20,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:58:20,869 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:58:21,047 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:58:21,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 181 transitions, 378 flow [2022-11-02 20:58:21,274 INFO L130 PetriNetUnfolder]: 10/179 cut-off events. [2022-11-02 20:58:21,275 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:58:21,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 179 events. 10/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2022-11-02 20:58:21,283 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 181 transitions, 378 flow [2022-11-02 20:58:21,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 169 transitions, 347 flow [2022-11-02 20:58:21,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:58:21,325 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@774c721b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:58:21,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:58:21,391 INFO L130 PetriNetUnfolder]: 4/134 cut-off events. [2022-11-02 20:58:21,392 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:58:21,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:21,393 INFO L208 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] [2022-11-02 20:58:21,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:21,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 157162230, now seen corresponding path program 1 times [2022-11-02 20:58:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461533648] [2022-11-02 20:58:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:21,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:21,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461533648] [2022-11-02 20:58:21,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461533648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:21,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:21,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932724481] [2022-11-02 20:58:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:21,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:21,930 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 181 [2022-11-02 20:58:21,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 169 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:21,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:21,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 181 [2022-11-02 20:58:21,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:22,200 INFO L130 PetriNetUnfolder]: 91/892 cut-off events. [2022-11-02 20:58:22,200 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-11-02 20:58:22,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 892 events. 91/892 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5348 event pairs, 15 based on Foata normal form. 61/880 useless extension candidates. Maximal degree in co-relation 903. Up to 96 conditions per place. [2022-11-02 20:58:22,213 INFO L137 encePairwiseOnDemand]: 172/181 looper letters, 19 selfloop transitions, 3 changer transitions 0/169 dead transitions. [2022-11-02 20:58:22,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 169 transitions, 397 flow [2022-11-02 20:58:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-02 20:58:22,234 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9429097605893186 [2022-11-02 20:58:22,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-02 20:58:22,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-02 20:58:22,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:22,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-02 20:58:22,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,255 INFO L175 Difference]: Start difference. First operand has 166 places, 169 transitions, 347 flow. Second operand 3 states and 512 transitions. [2022-11-02 20:58:22,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 169 transitions, 397 flow [2022-11-02 20:58:22,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 169 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:58:22,265 INFO L231 Difference]: Finished difference. Result has 162 places, 162 transitions, 343 flow [2022-11-02 20:58:22,267 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=162, PETRI_TRANSITIONS=162} [2022-11-02 20:58:22,271 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, -4 predicate places. [2022-11-02 20:58:22,271 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 162 transitions, 343 flow [2022-11-02 20:58:22,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:22,272 INFO L208 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] [2022-11-02 20:58:22,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:58:22,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 443184425, now seen corresponding path program 1 times [2022-11-02 20:58:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:22,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698163754] [2022-11-02 20:58:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:22,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:22,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698163754] [2022-11-02 20:58:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698163754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:22,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:22,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881287063] [2022-11-02 20:58:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:22,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:22,580 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 181 [2022-11-02 20:58:22,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 162 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:22,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 181 [2022-11-02 20:58:22,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:22,671 INFO L130 PetriNetUnfolder]: 21/421 cut-off events. [2022-11-02 20:58:22,671 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:58:22,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 421 events. 21/421 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1380 event pairs, 4 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 376. Up to 16 conditions per place. [2022-11-02 20:58:22,676 INFO L137 encePairwiseOnDemand]: 178/181 looper letters, 9 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-11-02 20:58:22,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 165 transitions, 371 flow [2022-11-02 20:58:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2022-11-02 20:58:22,679 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9392265193370166 [2022-11-02 20:58:22,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2022-11-02 20:58:22,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2022-11-02 20:58:22,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:22,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2022-11-02 20:58:22,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,687 INFO L175 Difference]: Start difference. First operand has 162 places, 162 transitions, 343 flow. Second operand 3 states and 510 transitions. [2022-11-02 20:58:22,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 165 transitions, 371 flow [2022-11-02 20:58:22,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 165 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:22,696 INFO L231 Difference]: Finished difference. Result has 164 places, 162 transitions, 348 flow [2022-11-02 20:58:22,696 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2022-11-02 20:58:22,697 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, -2 predicate places. [2022-11-02 20:58:22,697 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 348 flow [2022-11-02 20:58:22,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:22,699 INFO L208 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] [2022-11-02 20:58:22,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:58:22,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2134398008, now seen corresponding path program 1 times [2022-11-02 20:58:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:22,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332211035] [2022-11-02 20:58:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:22,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:22,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332211035] [2022-11-02 20:58:22,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332211035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:22,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:22,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:58:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755199885] [2022-11-02 20:58:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:58:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:58:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:22,916 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 181 [2022-11-02 20:58:22,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:22,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 181 [2022-11-02 20:58:22,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:23,110 INFO L130 PetriNetUnfolder]: 41/518 cut-off events. [2022-11-02 20:58:23,110 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:58:23,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 518 events. 41/518 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2026 event pairs, 13 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 403. Up to 37 conditions per place. [2022-11-02 20:58:23,116 INFO L137 encePairwiseOnDemand]: 176/181 looper letters, 16 selfloop transitions, 4 changer transitions 0/170 dead transitions. [2022-11-02 20:58:23,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 170 transitions, 409 flow [2022-11-02 20:58:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:58:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:58:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2022-11-02 20:58:23,119 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9185082872928176 [2022-11-02 20:58:23,120 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 665 transitions. [2022-11-02 20:58:23,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 665 transitions. [2022-11-02 20:58:23,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:23,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 665 transitions. [2022-11-02 20:58:23,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:23,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:23,125 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:23,126 INFO L175 Difference]: Start difference. First operand has 164 places, 162 transitions, 348 flow. Second operand 4 states and 665 transitions. [2022-11-02 20:58:23,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 170 transitions, 409 flow [2022-11-02 20:58:23,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 170 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:23,131 INFO L231 Difference]: Finished difference. Result has 168 places, 165 transitions, 374 flow [2022-11-02 20:58:23,132 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2022-11-02 20:58:23,133 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, 2 predicate places. [2022-11-02 20:58:23,133 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 374 flow [2022-11-02 20:58:23,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:23,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:23,134 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:23,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:58:23,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2007153870, now seen corresponding path program 1 times [2022-11-02 20:58:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:23,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514453132] [2022-11-02 20:58:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:23,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514453132] [2022-11-02 20:58:23,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514453132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:23,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044246051] [2022-11-02 20:58:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:23,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:23,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:23,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:58:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:58:23,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:23,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:24,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044246051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:24,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:24,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 20:58:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599599848] [2022-11-02 20:58:24,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:24,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:58:24,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:24,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:58:24,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:24,007 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 181 [2022-11-02 20:58:24,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 374 flow. Second operand has 10 states, 10 states have (on average 160.5) internal successors, (1605), 10 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:24,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:24,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 181 [2022-11-02 20:58:24,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:24,524 INFO L130 PetriNetUnfolder]: 176/1670 cut-off events. [2022-11-02 20:58:24,525 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-11-02 20:58:24,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 1670 events. 176/1670 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10746 event pairs, 28 based on Foata normal form. 9/1586 useless extension candidates. Maximal degree in co-relation 1750. Up to 135 conditions per place. [2022-11-02 20:58:24,546 INFO L137 encePairwiseOnDemand]: 175/181 looper letters, 48 selfloop transitions, 14 changer transitions 0/211 dead transitions. [2022-11-02 20:58:24,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 211 transitions, 623 flow [2022-11-02 20:58:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:58:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1644 transitions. [2022-11-02 20:58:24,553 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9082872928176795 [2022-11-02 20:58:24,553 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1644 transitions. [2022-11-02 20:58:24,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1644 transitions. [2022-11-02 20:58:24,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:24,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1644 transitions. [2022-11-02 20:58:24,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 164.4) internal successors, (1644), 10 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:24,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:24,570 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:24,570 INFO L175 Difference]: Start difference. First operand has 168 places, 165 transitions, 374 flow. Second operand 10 states and 1644 transitions. [2022-11-02 20:58:24,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 211 transitions, 623 flow [2022-11-02 20:58:24,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 211 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:24,578 INFO L231 Difference]: Finished difference. Result has 179 places, 178 transitions, 466 flow [2022-11-02 20:58:24,579 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=466, PETRI_PLACES=179, PETRI_TRANSITIONS=178} [2022-11-02 20:58:24,580 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, 13 predicate places. [2022-11-02 20:58:24,581 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 178 transitions, 466 flow [2022-11-02 20:58:24,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.5) internal successors, (1605), 10 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:24,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:24,583 INFO L208 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] [2022-11-02 20:58:24,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:24,798 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 407932096, now seen corresponding path program 1 times [2022-11-02 20:58:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:24,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353487415] [2022-11-02 20:58:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:24,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:24,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353487415] [2022-11-02 20:58:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353487415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:24,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:24,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475962097] [2022-11-02 20:58:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:24,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:24,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:24,972 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2022-11-02 20:58:24,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 178 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:24,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:24,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2022-11-02 20:58:24,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:25,182 INFO L130 PetriNetUnfolder]: 50/1067 cut-off events. [2022-11-02 20:58:25,182 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-02 20:58:25,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1067 events. 50/1067 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4613 event pairs, 10 based on Foata normal form. 12/1033 useless extension candidates. Maximal degree in co-relation 998. Up to 46 conditions per place. [2022-11-02 20:58:25,190 INFO L137 encePairwiseOnDemand]: 177/181 looper letters, 12 selfloop transitions, 4 changer transitions 0/175 dead transitions. [2022-11-02 20:58:25,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 477 flow [2022-11-02 20:58:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2022-11-02 20:58:25,192 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9116022099447514 [2022-11-02 20:58:25,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2022-11-02 20:58:25,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2022-11-02 20:58:25,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:25,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2022-11-02 20:58:25,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,196 INFO L175 Difference]: Start difference. First operand has 179 places, 178 transitions, 466 flow. Second operand 3 states and 495 transitions. [2022-11-02 20:58:25,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 477 flow [2022-11-02 20:58:25,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 175 transitions, 465 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:25,202 INFO L231 Difference]: Finished difference. Result has 179 places, 173 transitions, 434 flow [2022-11-02 20:58:25,202 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=179, PETRI_TRANSITIONS=173} [2022-11-02 20:58:25,203 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, 13 predicate places. [2022-11-02 20:58:25,203 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 173 transitions, 434 flow [2022-11-02 20:58:25,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:25,204 INFO L208 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] [2022-11-02 20:58:25,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:58:25,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1131747071, now seen corresponding path program 1 times [2022-11-02 20:58:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:25,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837968443] [2022-11-02 20:58:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:25,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837968443] [2022-11-02 20:58:25,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837968443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:25,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:25,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:58:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933781228] [2022-11-02 20:58:25,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:25,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:58:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:58:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:25,396 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2022-11-02 20:58:25,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 173 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:25,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2022-11-02 20:58:25,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:25,800 INFO L130 PetriNetUnfolder]: 116/1221 cut-off events. [2022-11-02 20:58:25,801 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-11-02 20:58:25,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 1221 events. 116/1221 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6022 event pairs, 19 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1103. Up to 178 conditions per place. [2022-11-02 20:58:25,810 INFO L137 encePairwiseOnDemand]: 170/181 looper letters, 49 selfloop transitions, 13 changer transitions 0/201 dead transitions. [2022-11-02 20:58:25,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 643 flow [2022-11-02 20:58:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:58:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:58:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1389 transitions. [2022-11-02 20:58:25,816 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.852670349907919 [2022-11-02 20:58:25,816 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1389 transitions. [2022-11-02 20:58:25,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1389 transitions. [2022-11-02 20:58:25,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:25,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1389 transitions. [2022-11-02 20:58:25,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 154.33333333333334) internal successors, (1389), 9 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,826 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,826 INFO L175 Difference]: Start difference. First operand has 179 places, 173 transitions, 434 flow. Second operand 9 states and 1389 transitions. [2022-11-02 20:58:25,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 643 flow [2022-11-02 20:58:25,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 201 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:25,836 INFO L231 Difference]: Finished difference. Result has 191 places, 180 transitions, 518 flow [2022-11-02 20:58:25,836 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=191, PETRI_TRANSITIONS=180} [2022-11-02 20:58:25,839 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, 25 predicate places. [2022-11-02 20:58:25,840 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 180 transitions, 518 flow [2022-11-02 20:58:25,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:25,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:25,848 INFO L208 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] [2022-11-02 20:58:25,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:58:25,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash 291633779, now seen corresponding path program 1 times [2022-11-02 20:58:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:25,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679985414] [2022-11-02 20:58:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679985414] [2022-11-02 20:58:28,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679985414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:28,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:28,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-11-02 20:58:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808605230] [2022-11-02 20:58:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:28,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:58:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:58:28,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:58:28,353 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 181 [2022-11-02 20:58:28,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 180 transitions, 518 flow. Second operand has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:28,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:28,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 181 [2022-11-02 20:58:28,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:32,187 INFO L130 PetriNetUnfolder]: 1000/3952 cut-off events. [2022-11-02 20:58:32,187 INFO L131 PetriNetUnfolder]: For 568/568 co-relation queries the response was YES. [2022-11-02 20:58:32,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 3952 events. 1000/3952 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 28279 event pairs, 289 based on Foata normal form. 0/3830 useless extension candidates. Maximal degree in co-relation 4319. Up to 1518 conditions per place. [2022-11-02 20:58:32,222 INFO L137 encePairwiseOnDemand]: 145/181 looper letters, 238 selfloop transitions, 39 changer transitions 4/370 dead transitions. [2022-11-02 20:58:32,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 370 transitions, 1584 flow [2022-11-02 20:58:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 20:58:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-02 20:58:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3462 transitions. [2022-11-02 20:58:32,235 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5625609359766006 [2022-11-02 20:58:32,235 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3462 transitions. [2022-11-02 20:58:32,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3462 transitions. [2022-11-02 20:58:32,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:32,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3462 transitions. [2022-11-02 20:58:32,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 101.82352941176471) internal successors, (3462), 34 states have internal predecessors, (3462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:32,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:32,259 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:32,259 INFO L175 Difference]: Start difference. First operand has 191 places, 180 transitions, 518 flow. Second operand 34 states and 3462 transitions. [2022-11-02 20:58:32,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 370 transitions, 1584 flow [2022-11-02 20:58:32,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 370 transitions, 1571 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-02 20:58:32,270 INFO L231 Difference]: Finished difference. Result has 245 places, 212 transitions, 782 flow [2022-11-02 20:58:32,270 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=782, PETRI_PLACES=245, PETRI_TRANSITIONS=212} [2022-11-02 20:58:32,271 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, 79 predicate places. [2022-11-02 20:58:32,271 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 212 transitions, 782 flow [2022-11-02 20:58:32,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:32,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:32,273 INFO L208 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] [2022-11-02 20:58:32,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:58:32,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash -271614661, now seen corresponding path program 2 times [2022-11-02 20:58:32,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:32,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596081053] [2022-11-02 20:58:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:32,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:34,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596081053] [2022-11-02 20:58:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596081053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:34,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-11-02 20:58:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990801777] [2022-11-02 20:58:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:58:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:58:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:58:34,779 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 181 [2022-11-02 20:58:34,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 212 transitions, 782 flow. Second operand has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:34,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:34,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 181 [2022-11-02 20:58:34,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:38,878 INFO L130 PetriNetUnfolder]: 1158/4609 cut-off events. [2022-11-02 20:58:38,878 INFO L131 PetriNetUnfolder]: For 1244/1244 co-relation queries the response was YES. [2022-11-02 20:58:38,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9824 conditions, 4609 events. 1158/4609 cut-off events. For 1244/1244 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 34950 event pairs, 58 based on Foata normal form. 4/4536 useless extension candidates. Maximal degree in co-relation 5564. Up to 1307 conditions per place. [2022-11-02 20:58:38,931 INFO L137 encePairwiseOnDemand]: 146/181 looper letters, 239 selfloop transitions, 56 changer transitions 4/388 dead transitions. [2022-11-02 20:58:38,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 388 transitions, 1987 flow [2022-11-02 20:58:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 20:58:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-02 20:58:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3462 transitions. [2022-11-02 20:58:38,940 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5625609359766006 [2022-11-02 20:58:38,940 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3462 transitions. [2022-11-02 20:58:38,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3462 transitions. [2022-11-02 20:58:38,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:38,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3462 transitions. [2022-11-02 20:58:38,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 101.82352941176471) internal successors, (3462), 34 states have internal predecessors, (3462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,964 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,964 INFO L175 Difference]: Start difference. First operand has 245 places, 212 transitions, 782 flow. Second operand 34 states and 3462 transitions. [2022-11-02 20:58:38,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 388 transitions, 1987 flow [2022-11-02 20:58:39,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 388 transitions, 1973 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-02 20:58:39,060 INFO L231 Difference]: Finished difference. Result has 284 places, 229 transitions, 1052 flow [2022-11-02 20:58:39,061 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1052, PETRI_PLACES=284, PETRI_TRANSITIONS=229} [2022-11-02 20:58:39,065 INFO L287 CegarLoopForPetriNet]: 166 programPoint places, 118 predicate places. [2022-11-02 20:58:39,065 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 229 transitions, 1052 flow [2022-11-02 20:58:39,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:39,067 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:39,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:58:39,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:58:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash -305676899, now seen corresponding path program 1 times [2022-11-02 20:58:39,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:39,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056233920] [2022-11-02 20:58:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:58:39,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:58:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:58:39,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:58:39,203 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:58:39,204 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-02 20:58:39,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-11-02 20:58:39,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 20:58:39,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-02 20:58:39,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-02 20:58:39,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 20:58:39,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:58:39,208 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:39,214 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:58:39,214 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:58:39,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:58:39 BasicIcfg [2022-11-02 20:58:39,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:58:39,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:58:39,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:58:39,359 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:58:39,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:20" (3/4) ... [2022-11-02 20:58:39,361 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:58:39,525 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:58:39,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:58:39,526 INFO L158 Benchmark]: Toolchain (without parser) took 20151.61ms. Allocated memory was 117.4MB in the beginning and 346.0MB in the end (delta: 228.6MB). Free memory was 82.8MB in the beginning and 129.6MB in the end (delta: -46.8MB). Peak memory consumption was 181.1MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,527 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 88.1MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:39,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.33ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 71.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.93ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,528 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:39,528 INFO L158 Benchmark]: RCFGBuilder took 634.01ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 49.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,528 INFO L158 Benchmark]: TraceAbstraction took 18524.10ms. Allocated memory was 117.4MB in the beginning and 346.0MB in the end (delta: 228.6MB). Free memory was 48.3MB in the beginning and 167.4MB in the end (delta: -119.1MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,529 INFO L158 Benchmark]: Witness Printer took 166.85ms. Allocated memory is still 346.0MB. Free memory was 167.4MB in the beginning and 129.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-02 20:58:39,530 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 88.1MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.33ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 71.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.93ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 634.01ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 49.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18524.10ms. Allocated memory was 117.4MB in the beginning and 346.0MB in the end (delta: 228.6MB). Free memory was 48.3MB in the beginning and 167.4MB in the end (delta: -119.1MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. * Witness Printer took 166.85ms. Allocated memory is still 346.0MB. Free memory was 167.4MB in the beginning and 129.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; VAL [top=0] [L936] 0 static unsigned int arr[(800)]; VAL [arr={5:0}, top=0] [L937] 0 pthread_mutex_t m; VAL [arr={5:0}, m={6:0}, top=0] [L938] 0 _Bool flag=(0); VAL [arr={5:0}, flag=0, m={6:0}, top=0] [L1020] 0 pthread_t id1, id2; VAL [arr={5:0}, flag=0, id1={9:0}, id2={7:0}, m={6:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={5:0}, flag=0, id1={9:0}, id2={7:0}, m={6:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=10, top=0] [L989] 1 int i; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, m={6:0}, top=0] [L990] 1 unsigned int tmp; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, m={6:0}, top=0] [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294968095, arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, tmp=799, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={5:0}, flag=0, id1={9:0}, id2={7:0}, m={6:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=11, top=0] [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={5:0}, cond=1, flag=0, m={6:0}, top=0] [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) VAL [\old(x)=799, arr={5:0}, flag=0, m={6:0}, stack={5:0}, stack={5:0}, top=0, x=799] [L968] CALL, EXPR 1 get_top() [L953] 1 return top; VAL [\result=0, arr={5:0}, flag=0, m={6:0}, top=0] [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x VAL [\old(x)=799, arr={5:0}, flag=0, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, top=0, x=799] [L969] CALL 1 inc_top() [L945] 1 top++ VAL [arr={5:0}, flag=0, m={6:0}, top=1] [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(x)=799, \result=0, arr={5:0}, flag=0, m={6:0}, stack={5:0}, stack={5:0}, top=1, x=799] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, push(arr,tmp)=0, tmp=799, top=1] [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, tmp=799, top=1] [L1005] 2 int i; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, m={6:0}, top=1] [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1009] COND TRUE 2 \read(flag) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=1, \result=0, arr={5:0}, flag=1, m={6:0}, top=1] [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) VAL [arr={5:0}, flag=1, get_top()=1, m={6:0}, stack={5:0}, stack={5:0}, top=1] [L982] CALL 2 dec_top() [L949] 2 top-- VAL [arr={5:0}, flag=1, m={6:0}, top=0] [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=0, \result=0, arr={5:0}, flag=1, m={6:0}, top=0] [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] VAL [arr={5:0}, flag=1, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, stack[get_top()]=799, top=0] [L983] 2 return stack[get_top()]; VAL [\result=799, arr={5:0}, flag=1, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, stack[get_top()]=799, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, pop(arr)=799, top=0] [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1009] COND TRUE 2 \read(flag) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=0, \result=0, arr={5:0}, flag=1, m={6:0}, top=0] [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 VAL [arr={5:0}, flag=1, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, top=0] [L978] 2 return (-2); VAL [\result=-2, arr={5:0}, flag=1, m={6:0}, stack={5:0}, stack={5:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, pop(arr)=-2, top=0] [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={5:0}, flag=1, m={6:0}, top=0] - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 290 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 841 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 841 mSDsluCounter, 2412 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2792 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4307 IncrementalHoareTripleChecker+Invalid, 4353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 197 mSDtfsCounter, 4307 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1052occurred in iteration=8, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 6594 SizeOfPredicates, 2 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 12/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:58:39,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6a2c15-b296-486e-b6c2-abaa272cfea5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE