./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:52:35,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:52:35,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:52:35,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:52:35,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:52:35,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:52:35,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:52:35,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:52:35,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:52:35,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:52:35,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:52:35,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:52:35,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:52:35,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:52:35,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:52:35,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:52:35,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:52:35,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:52:35,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:52:35,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:52:35,936 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:52:35,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:52:35,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:52:35,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:52:35,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:52:35,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:52:35,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:52:35,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:52:35,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:52:35,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:52:35,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:52:35,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:52:35,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:52:35,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:52:35,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:52:35,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:52:35,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:52:35,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:52:35,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:52:35,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:52:35,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:52:35,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:52:35,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:52:35,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:52:35,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:52:35,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:52:35,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:52:35,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:52:35,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:52:35,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:52:35,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:52:35,979 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:52:35,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:52:35,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:52:35,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:52:35,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:52:35,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:52:35,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:52:35,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:52:35,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:52:35,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:52:35,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:52:35,989 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:52:35,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:52:35,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:52:35,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:52:35,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:52:35,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:52:35,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:52:35,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:52:35,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:52:35,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:52:35,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:52:35,991 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:52:35,991 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:52:35,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:52:35,992 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 [2022-07-21 08:52:36,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:52:36,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:52:36,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:52:36,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:52:36,334 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:52:36,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-07-21 08:52:36,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6206cf6/8134cb794a024fb0a13675d42ba25af0/FLAG7f7e0d5f6 [2022-07-21 08:52:36,839 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:52:36,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-07-21 08:52:36,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6206cf6/8134cb794a024fb0a13675d42ba25af0/FLAG7f7e0d5f6 [2022-07-21 08:52:36,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6206cf6/8134cb794a024fb0a13675d42ba25af0 [2022-07-21 08:52:36,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:52:36,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:52:36,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:52:36,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:52:36,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:52:36,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:52:36" (1/1) ... [2022-07-21 08:52:36,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227bebfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:36, skipping insertion in model container [2022-07-21 08:52:36,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:52:36" (1/1) ... [2022-07-21 08:52:36,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:52:36,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:52:37,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-07-21 08:52:37,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:52:37,267 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:52:37,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-07-21 08:52:37,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:52:37,375 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:52:37,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37 WrapperNode [2022-07-21 08:52:37,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:52:37,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:52:37,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:52:37,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:52:37,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,439 INFO L137 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 198 [2022-07-21 08:52:37,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:52:37,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:52:37,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:52:37,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:52:37,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:52:37,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:52:37,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:52:37,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:52:37,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (1/1) ... [2022-07-21 08:52:37,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:52:37,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:52:37,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 08:52:37,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 08:52:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:52:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:52:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 08:52:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:52:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-21 08:52:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:52:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-21 08:52:37,545 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-21 08:52:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:52:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:52:37,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:52:37,547 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:52:37,658 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:52:37,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:52:37,909 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:52:37,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:52:37,915 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2022-07-21 08:52:37,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:52:37 BoogieIcfgContainer [2022-07-21 08:52:37,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:52:37,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:52:37,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:52:37,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:52:37,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:52:36" (1/3) ... [2022-07-21 08:52:37,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb415cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:52:37, skipping insertion in model container [2022-07-21 08:52:37,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:52:37" (2/3) ... [2022-07-21 08:52:37,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb415cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:52:37, skipping insertion in model container [2022-07-21 08:52:37,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:52:37" (3/3) ... [2022-07-21 08:52:37,922 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-07-21 08:52:37,925 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:52:37,931 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:52:37,931 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:52:37,931 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:52:37,986 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-21 08:52:38,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 203 transitions, 414 flow [2022-07-21 08:52:38,080 INFO L129 PetriNetUnfolder]: 42/275 cut-off events. [2022-07-21 08:52:38,081 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-21 08:52:38,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 275 events. 42/275 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 888 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2022-07-21 08:52:38,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 203 transitions, 414 flow [2022-07-21 08:52:38,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 198 transitions, 401 flow [2022-07-21 08:52:38,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:52:38,107 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58d03409, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48629f25 [2022-07-21 08:52:38,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-21 08:52:38,136 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-07-21 08:52:38,136 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:52:38,136 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:38,137 INFO L200 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] [2022-07-21 08:52:38,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 08:52:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1755706946, now seen corresponding path program 1 times [2022-07-21 08:52:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:38,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384665190] [2022-07-21 08:52:38,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:38,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:52:38,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384665190] [2022-07-21 08:52:38,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384665190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:52:38,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:52:38,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 08:52:38,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687649156] [2022-07-21 08:52:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:52:38,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:52:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:52:38,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:52:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:52:38,377 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2022-07-21 08:52:38,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 198 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:52:38,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:52:38,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2022-07-21 08:52:38,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:52:38,435 INFO L129 PetriNetUnfolder]: 3/176 cut-off events. [2022-07-21 08:52:38,439 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:52:38,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 296 event pairs, 0 based on Foata normal form. 40/209 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2022-07-21 08:52:38,443 INFO L132 encePairwiseOnDemand]: 176/203 looper letters, 8 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2022-07-21 08:52:38,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 373 flow [2022-07-21 08:52:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:52:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:52:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2022-07-21 08:52:38,455 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2022-07-21 08:52:38,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2022-07-21 08:52:38,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2022-07-21 08:52:38,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:52:38,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2022-07-21 08:52:38,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 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-07-21 08:52:38,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 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-07-21 08:52:38,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 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-07-21 08:52:38,468 INFO L186 Difference]: Start difference. First operand has 174 places, 198 transitions, 401 flow. Second operand 3 states and 551 transitions. [2022-07-21 08:52:38,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 373 flow [2022-07-21 08:52:38,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 174 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 08:52:38,475 INFO L242 Difference]: Finished difference. Result has 175 places, 172 transitions, 357 flow [2022-07-21 08:52:38,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2022-07-21 08:52:38,479 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2022-07-21 08:52:38,479 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 357 flow [2022-07-21 08:52:38,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:52:38,479 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:38,480 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-21 08:52:38,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:52:38,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 08:52:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash 341960441, now seen corresponding path program 1 times [2022-07-21 08:52:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:38,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292606026] [2022-07-21 08:52:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:52:38,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:52:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:52:38,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:52:38,602 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:52:38,603 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-07-21 08:52:38,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-07-21 08:52:38,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-07-21 08:52:38,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-07-21 08:52:38,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:52:38,609 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-21 08:52:38,613 WARN L231 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-21 08:52:38,613 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-07-21 08:52:38,643 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-21 08:52:38,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 263 transitions, 544 flow [2022-07-21 08:52:38,720 INFO L129 PetriNetUnfolder]: 71/432 cut-off events. [2022-07-21 08:52:38,720 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-21 08:52:38,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 432 events. 71/432 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1670 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 277. Up to 12 conditions per place. [2022-07-21 08:52:38,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 263 transitions, 544 flow [2022-07-21 08:52:38,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 263 transitions, 544 flow [2022-07-21 08:52:38,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:52:38,737 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58d03409, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48629f25 [2022-07-21 08:52:38,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-21 08:52:38,749 INFO L129 PetriNetUnfolder]: 15/169 cut-off events. [2022-07-21 08:52:38,749 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-21 08:52:38,749 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:38,749 INFO L200 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] [2022-07-21 08:52:38,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 08:52:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash -985271127, now seen corresponding path program 1 times [2022-07-21 08:52:38,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:38,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791736160] [2022-07-21 08:52:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:38,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:52:38,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791736160] [2022-07-21 08:52:38,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791736160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:52:38,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:52:38,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 08:52:38,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455575108] [2022-07-21 08:52:38,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:52:38,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:52:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:52:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:52:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:52:38,835 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 263 [2022-07-21 08:52:38,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 263 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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-07-21 08:52:38,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:52:38,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 263 [2022-07-21 08:52:38,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:52:38,901 INFO L129 PetriNetUnfolder]: 7/320 cut-off events. [2022-07-21 08:52:38,902 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-07-21 08:52:38,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 320 events. 7/320 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1017 event pairs, 0 based on Foata normal form. 127/432 useless extension candidates. Maximal degree in co-relation 203. Up to 16 conditions per place. [2022-07-21 08:52:38,905 INFO L132 encePairwiseOnDemand]: 225/263 looper letters, 13 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2022-07-21 08:52:38,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 229 transitions, 506 flow [2022-07-21 08:52:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:52:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:52:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-07-21 08:52:38,909 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8935361216730038 [2022-07-21 08:52:38,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-07-21 08:52:38,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-07-21 08:52:38,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:52:38,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-07-21 08:52:38,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:52:38,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 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-07-21 08:52:38,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 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-07-21 08:52:38,913 INFO L186 Difference]: Start difference. First operand has 227 places, 263 transitions, 544 flow. Second operand 3 states and 705 transitions. [2022-07-21 08:52:38,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 229 transitions, 506 flow [2022-07-21 08:52:38,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 08:52:38,923 INFO L242 Difference]: Finished difference. Result has 227 places, 226 transitions, 480 flow [2022-07-21 08:52:38,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-07-21 08:52:38,924 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 0 predicate places. [2022-07-21 08:52:38,924 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 480 flow [2022-07-21 08:52:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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-07-21 08:52:38,924 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:38,924 INFO L200 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] [2022-07-21 08:52:38,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:52:38,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 08:52:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash 699851186, now seen corresponding path program 1 times [2022-07-21 08:52:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:38,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424215086] [2022-07-21 08:52:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:52:39,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424215086] [2022-07-21 08:52:39,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424215086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:52:39,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:52:39,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:52:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434636089] [2022-07-21 08:52:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:52:39,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:52:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:52:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:52:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:52:39,115 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 263 [2022-07-21 08:52:39,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 480 flow. Second operand has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 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-07-21 08:52:39,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:52:39,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 263 [2022-07-21 08:52:39,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:52:40,484 INFO L129 PetriNetUnfolder]: 2234/8522 cut-off events. [2022-07-21 08:52:40,484 INFO L130 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-07-21 08:52:40,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12402 conditions, 8522 events. 2234/8522 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 97784 event pairs, 583 based on Foata normal form. 0/8170 useless extension candidates. Maximal degree in co-relation 12285. Up to 1371 conditions per place. [2022-07-21 08:52:40,565 INFO L132 encePairwiseOnDemand]: 248/263 looper letters, 187 selfloop transitions, 44 changer transitions 58/452 dead transitions. [2022-07-21 08:52:40,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 452 transitions, 1574 flow [2022-07-21 08:52:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 08:52:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-21 08:52:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4181 transitions. [2022-07-21 08:52:40,588 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6623891001267427 [2022-07-21 08:52:40,588 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4181 transitions. [2022-07-21 08:52:40,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4181 transitions. [2022-07-21 08:52:40,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:52:40,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4181 transitions. [2022-07-21 08:52:40,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 174.20833333333334) internal successors, (4181), 24 states have internal predecessors, (4181), 0 states have call successors, (0), 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-07-21 08:52:40,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 0 states have call successors, (0), 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-07-21 08:52:40,624 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 0 states have call successors, (0), 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-07-21 08:52:40,627 INFO L186 Difference]: Start difference. First operand has 227 places, 226 transitions, 480 flow. Second operand 24 states and 4181 transitions. [2022-07-21 08:52:40,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 452 transitions, 1574 flow [2022-07-21 08:52:40,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 452 transitions, 1572 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 08:52:40,667 INFO L242 Difference]: Finished difference. Result has 260 places, 276 transitions, 783 flow [2022-07-21 08:52:40,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=783, PETRI_PLACES=260, PETRI_TRANSITIONS=276} [2022-07-21 08:52:40,669 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 33 predicate places. [2022-07-21 08:52:40,669 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 276 transitions, 783 flow [2022-07-21 08:52:40,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 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-07-21 08:52:40,670 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:40,671 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-07-21 08:52:40,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:52:40,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 08:52:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1556719885, now seen corresponding path program 1 times [2022-07-21 08:52:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:40,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4851244] [2022-07-21 08:52:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:52:40,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:52:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:52:40,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:52:40,749 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:52:40,750 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-21 08:52:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-21 08:52:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-21 08:52:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-21 08:52:40,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-21 08:52:40,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:52:40,750 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-21 08:52:40,751 WARN L231 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-21 08:52:40,751 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-07-21 08:52:40,778 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-21 08:52:40,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 276 places, 323 transitions, 676 flow [2022-07-21 08:52:40,841 INFO L129 PetriNetUnfolder]: 105/622 cut-off events. [2022-07-21 08:52:40,841 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-07-21 08:52:40,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 622 events. 105/622 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2641 event pairs, 1 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 440. Up to 16 conditions per place. [2022-07-21 08:52:40,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 323 transitions, 676 flow [2022-07-21 08:52:40,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 323 transitions, 676 flow [2022-07-21 08:52:40,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:52:40,861 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58d03409, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48629f25 [2022-07-21 08:52:40,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-21 08:52:40,870 INFO L129 PetriNetUnfolder]: 16/169 cut-off events. [2022-07-21 08:52:40,870 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-21 08:52:40,870 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:40,871 INFO L200 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] [2022-07-21 08:52:40,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-21 08:52:40,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash 645618892, now seen corresponding path program 1 times [2022-07-21 08:52:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:40,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874178622] [2022-07-21 08:52:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:52:40,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874178622] [2022-07-21 08:52:40,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874178622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:52:40,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:52:40,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 08:52:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723097367] [2022-07-21 08:52:40,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:52:40,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:52:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:52:40,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:52:40,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:52:40,942 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-07-21 08:52:40,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 323 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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-07-21 08:52:40,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:52:40,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-07-21 08:52:40,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:52:41,044 INFO L129 PetriNetUnfolder]: 14/481 cut-off events. [2022-07-21 08:52:41,044 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-07-21 08:52:41,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 481 events. 14/481 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1920 event pairs, 1 based on Foata normal form. 335/792 useless extension candidates. Maximal degree in co-relation 348. Up to 30 conditions per place. [2022-07-21 08:52:41,050 INFO L132 encePairwiseOnDemand]: 274/323 looper letters, 15 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2022-07-21 08:52:41,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 618 flow [2022-07-21 08:52:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:52:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:52:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2022-07-21 08:52:41,053 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8833849329205367 [2022-07-21 08:52:41,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 856 transitions. [2022-07-21 08:52:41,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 856 transitions. [2022-07-21 08:52:41,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:52:41,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 856 transitions. [2022-07-21 08:52:41,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 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-07-21 08:52:41,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 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-07-21 08:52:41,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 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-07-21 08:52:41,057 INFO L186 Difference]: Start difference. First operand has 276 places, 323 transitions, 676 flow. Second operand 3 states and 856 transitions. [2022-07-21 08:52:41,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 618 flow [2022-07-21 08:52:41,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 277 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 08:52:41,061 INFO L242 Difference]: Finished difference. Result has 275 places, 274 transitions, 588 flow [2022-07-21 08:52:41,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2022-07-21 08:52:41,062 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -1 predicate places. [2022-07-21 08:52:41,062 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 588 flow [2022-07-21 08:52:41,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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-07-21 08:52:41,062 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:41,062 INFO L200 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] [2022-07-21 08:52:41,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:52:41,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-21 08:52:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash 179903816, now seen corresponding path program 1 times [2022-07-21 08:52:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:41,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749417448] [2022-07-21 08:52:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:41,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:52:41,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749417448] [2022-07-21 08:52:41,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749417448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:52:41,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:52:41,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:52:41,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960011375] [2022-07-21 08:52:41,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:52:41,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:52:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:52:41,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:52:41,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:52:41,158 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-07-21 08:52:41,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 588 flow. Second operand has 10 states, 10 states have (on average 207.1) internal successors, (2071), 10 states have internal predecessors, (2071), 0 states have call successors, (0), 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-07-21 08:52:41,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:52:41,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-07-21 08:52:41,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:52:49,031 INFO L129 PetriNetUnfolder]: 23971/72143 cut-off events. [2022-07-21 08:52:49,031 INFO L130 PetriNetUnfolder]: For 2761/2761 co-relation queries the response was YES. [2022-07-21 08:52:49,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107751 conditions, 72143 events. 23971/72143 cut-off events. For 2761/2761 co-relation queries the response was YES. Maximal size of possible extension queue 2962. Compared 1040069 event pairs, 5334 based on Foata normal form. 0/70062 useless extension candidates. Maximal degree in co-relation 107633. Up to 13661 conditions per place. [2022-07-21 08:52:49,591 INFO L132 encePairwiseOnDemand]: 307/323 looper letters, 343 selfloop transitions, 58 changer transitions 0/605 dead transitions. [2022-07-21 08:52:49,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 605 transitions, 2216 flow [2022-07-21 08:52:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 08:52:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-21 08:52:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5277 transitions. [2022-07-21 08:52:49,601 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6807275541795665 [2022-07-21 08:52:49,601 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5277 transitions. [2022-07-21 08:52:49,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5277 transitions. [2022-07-21 08:52:49,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:52:49,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5277 transitions. [2022-07-21 08:52:49,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 219.875) internal successors, (5277), 24 states have internal predecessors, (5277), 0 states have call successors, (0), 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-07-21 08:52:49,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 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-07-21 08:52:49,625 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 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-07-21 08:52:49,625 INFO L186 Difference]: Start difference. First operand has 275 places, 274 transitions, 588 flow. Second operand 24 states and 5277 transitions. [2022-07-21 08:52:49,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 605 transitions, 2216 flow [2022-07-21 08:52:49,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 605 transitions, 2214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 08:52:49,637 INFO L242 Difference]: Finished difference. Result has 311 places, 335 transitions, 1008 flow [2022-07-21 08:52:49,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1008, PETRI_PLACES=311, PETRI_TRANSITIONS=335} [2022-07-21 08:52:49,640 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 35 predicate places. [2022-07-21 08:52:49,647 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 335 transitions, 1008 flow [2022-07-21 08:52:49,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 207.1) internal successors, (2071), 10 states have internal predecessors, (2071), 0 states have call successors, (0), 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-07-21 08:52:49,650 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:49,650 INFO L200 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] [2022-07-21 08:52:49,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:52:49,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-21 08:52:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1053447860, now seen corresponding path program 1 times [2022-07-21 08:52:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:49,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403053766] [2022-07-21 08:52:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:49,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:52:49,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403053766] [2022-07-21 08:52:49,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403053766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:52:49,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462924454] [2022-07-21 08:52:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:49,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:52:49,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:52:49,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:52:49,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 08:52:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:49,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 08:52:49,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:52:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:49,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:52:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:52:49,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462924454] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:52:49,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:52:49,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-21 08:52:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201085191] [2022-07-21 08:52:49,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:52:49,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:52:49,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:52:49,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:52:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:52:49,916 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 323 [2022-07-21 08:52:49,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 335 transitions, 1008 flow. Second operand has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 0 states have call successors, (0), 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-07-21 08:52:49,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:52:49,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 323 [2022-07-21 08:52:49,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:52:50,477 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 160#L1013-32true, Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 307#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5))]) [2022-07-21 08:52:50,478 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-07-21 08:52:50,478 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-07-21 08:52:50,478 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-07-21 08:52:50,478 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-07-21 08:52:50,483 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, 3#L1013-8true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-07-21 08:52:50,484 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-07-21 08:52:50,484 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-07-21 08:52:50,484 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-07-21 08:52:50,484 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-07-21 08:52:50,485 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [235#L999-1true, 79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 347#true, t_funThread3of3ForFork0NotInUse, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-07-21 08:52:50,486 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-07-21 08:52:50,486 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-21 08:52:50,486 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-21 08:52:50,486 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-07-21 08:52:50,495 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, 200#L1013-34true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-07-21 08:52:50,495 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-07-21 08:52:50,495 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-07-21 08:52:50,495 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-07-21 08:52:50,495 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-07-21 08:52:50,512 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0NotInUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-07-21 08:52:50,512 INFO L384 tUnfolder$Statistics]: this new event has 214 ancestors and is cut-off event [2022-07-21 08:52:50,512 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-21 08:52:50,512 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-07-21 08:52:50,512 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-21 08:52:50,520 INFO L129 PetriNetUnfolder]: 554/4225 cut-off events. [2022-07-21 08:52:50,520 INFO L130 PetriNetUnfolder]: For 7181/7813 co-relation queries the response was YES. [2022-07-21 08:52:50,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8535 conditions, 4225 events. 554/4225 cut-off events. For 7181/7813 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 42248 event pairs, 134 based on Foata normal form. 37/4037 useless extension candidates. Maximal degree in co-relation 8370. Up to 493 conditions per place. [2022-07-21 08:52:50,587 INFO L132 encePairwiseOnDemand]: 317/323 looper letters, 16 selfloop transitions, 9 changer transitions 0/345 dead transitions. [2022-07-21 08:52:50,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 345 transitions, 1080 flow [2022-07-21 08:52:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:52:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:52:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2358 transitions. [2022-07-21 08:52:50,592 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8111455108359134 [2022-07-21 08:52:50,592 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2358 transitions. [2022-07-21 08:52:50,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2358 transitions. [2022-07-21 08:52:50,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:52:50,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2358 transitions. [2022-07-21 08:52:50,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 262.0) internal successors, (2358), 9 states have internal predecessors, (2358), 0 states have call successors, (0), 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-07-21 08:52:50,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 0 states have call successors, (0), 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-07-21 08:52:50,601 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 0 states have call successors, (0), 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-07-21 08:52:50,601 INFO L186 Difference]: Start difference. First operand has 311 places, 335 transitions, 1008 flow. Second operand 9 states and 2358 transitions. [2022-07-21 08:52:50,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 345 transitions, 1080 flow [2022-07-21 08:52:50,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 345 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 08:52:50,625 INFO L242 Difference]: Finished difference. Result has 321 places, 341 transitions, 1057 flow [2022-07-21 08:52:50,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1057, PETRI_PLACES=321, PETRI_TRANSITIONS=341} [2022-07-21 08:52:50,626 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 45 predicate places. [2022-07-21 08:52:50,626 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 341 transitions, 1057 flow [2022-07-21 08:52:50,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 0 states have call successors, (0), 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-07-21 08:52:50,627 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:52:50,627 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-21 08:52:50,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 08:52:50,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:52:50,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-21 08:52:50,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:52:50,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1734664745, now seen corresponding path program 1 times [2022-07-21 08:52:50,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:52:50,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568127930] [2022-07-21 08:52:50,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:50,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:52:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 08:52:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:52:50,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568127930] [2022-07-21 08:52:50,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568127930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:52:50,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060287704] [2022-07-21 08:52:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:52:50,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:52:50,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:52:50,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:52:50,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 08:52:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:52:51,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 08:52:51,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:52:51,233 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 08:52:51,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 08:52:51,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 08:52:51,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 08:52:51,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 08:52:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 08:52:51,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:52:51,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_130) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-07-21 08:52:51,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 08:52:51,622 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 08:52:51,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 08:52:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-07-21 08:52:51,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060287704] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:52:51,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:52:51,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-07-21 08:52:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285375607] [2022-07-21 08:52:51,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:52:51,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 08:52:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:52:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 08:52:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2022-07-21 08:52:51,628 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-07-21 08:52:51,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 341 transitions, 1057 flow. Second operand has 17 states, 17 states have (on average 207.05882352941177) internal successors, (3520), 17 states have internal predecessors, (3520), 0 states have call successors, (0), 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-07-21 08:52:51,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:52:51,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-07-21 08:52:51,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:53:15,945 INFO L129 PetriNetUnfolder]: 54158/182335 cut-off events. [2022-07-21 08:53:15,946 INFO L130 PetriNetUnfolder]: For 320681/322897 co-relation queries the response was YES. [2022-07-21 08:53:17,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370604 conditions, 182335 events. 54158/182335 cut-off events. For 320681/322897 co-relation queries the response was YES. Maximal size of possible extension queue 7648. Compared 3078998 event pairs, 17513 based on Foata normal form. 391/175045 useless extension candidates. Maximal degree in co-relation 349392. Up to 32560 conditions per place. [2022-07-21 08:53:18,701 INFO L132 encePairwiseOnDemand]: 307/323 looper letters, 398 selfloop transitions, 157 changer transitions 22/804 dead transitions. [2022-07-21 08:53:18,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 804 transitions, 4278 flow [2022-07-21 08:53:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 08:53:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-21 08:53:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5289 transitions. [2022-07-21 08:53:18,710 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6822755417956656 [2022-07-21 08:53:18,710 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5289 transitions. [2022-07-21 08:53:18,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5289 transitions. [2022-07-21 08:53:18,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:53:18,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5289 transitions. [2022-07-21 08:53:18,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 220.375) internal successors, (5289), 24 states have internal predecessors, (5289), 0 states have call successors, (0), 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-07-21 08:53:18,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 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-07-21 08:53:18,729 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 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-07-21 08:53:18,729 INFO L186 Difference]: Start difference. First operand has 321 places, 341 transitions, 1057 flow. Second operand 24 states and 5289 transitions. [2022-07-21 08:53:18,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 804 transitions, 4278 flow [2022-07-21 08:53:20,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 804 transitions, 4272 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-21 08:53:20,867 INFO L242 Difference]: Finished difference. Result has 354 places, 465 transitions, 2169 flow [2022-07-21 08:53:20,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2169, PETRI_PLACES=354, PETRI_TRANSITIONS=465} [2022-07-21 08:53:20,869 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 78 predicate places. [2022-07-21 08:53:20,869 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 465 transitions, 2169 flow [2022-07-21 08:53:20,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 207.05882352941177) internal successors, (3520), 17 states have internal predecessors, (3520), 0 states have call successors, (0), 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-07-21 08:53:20,870 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:53:20,870 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 08:53:20,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 08:53:21,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-21 08:53:21,087 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-21 08:53:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:53:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -405832410, now seen corresponding path program 1 times [2022-07-21 08:53:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:53:21,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495636435] [2022-07-21 08:53:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:53:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:53:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:53:21,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:53:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:53:21,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:53:21,119 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:53:21,119 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-07-21 08:53:21,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-21 08:53:21,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-07-21 08:53:21,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-21 08:53:21,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-21 08:53:21,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-21 08:53:21,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:53:21,120 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-21 08:53:21,121 WARN L231 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-21 08:53:21,121 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-07-21 08:53:21,140 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-21 08:53:21,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 325 places, 383 transitions, 810 flow [2022-07-21 08:53:21,255 INFO L129 PetriNetUnfolder]: 151/880 cut-off events. [2022-07-21 08:53:21,256 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-07-21 08:53:21,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 880 events. 151/880 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4022 event pairs, 6 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 642. Up to 32 conditions per place. [2022-07-21 08:53:21,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 383 transitions, 810 flow [2022-07-21 08:53:21,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 383 transitions, 810 flow [2022-07-21 08:53:21,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:53:21,285 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58d03409, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48629f25 [2022-07-21 08:53:21,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-21 08:53:21,293 INFO L129 PetriNetUnfolder]: 17/170 cut-off events. [2022-07-21 08:53:21,293 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-21 08:53:21,293 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:53:21,293 INFO L200 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] [2022-07-21 08:53:21,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-21 08:53:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:53:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 971767631, now seen corresponding path program 1 times [2022-07-21 08:53:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:53:21,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260034798] [2022-07-21 08:53:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:53:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:53:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:53:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:53:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:53:21,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260034798] [2022-07-21 08:53:21,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260034798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:53:21,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:53:21,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 08:53:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991706076] [2022-07-21 08:53:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:53:21,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:53:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:53:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:53:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:53:21,315 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 383 [2022-07-21 08:53:21,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 383 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 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-07-21 08:53:21,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:53:21,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 383 [2022-07-21 08:53:21,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:53:21,451 INFO L129 PetriNetUnfolder]: 29/706 cut-off events. [2022-07-21 08:53:21,452 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-07-21 08:53:21,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 706 events. 29/706 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3256 event pairs, 6 based on Foata normal form. 735/1404 useless extension candidates. Maximal degree in co-relation 535. Up to 56 conditions per place. [2022-07-21 08:53:21,464 INFO L132 encePairwiseOnDemand]: 323/383 looper letters, 17 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2022-07-21 08:53:21,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 325 transitions, 732 flow [2022-07-21 08:53:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:53:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:53:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2022-07-21 08:53:21,466 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.876414273281114 [2022-07-21 08:53:21,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1007 transitions. [2022-07-21 08:53:21,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1007 transitions. [2022-07-21 08:53:21,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:53:21,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1007 transitions. [2022-07-21 08:53:21,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 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-07-21 08:53:21,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 0 states have call successors, (0), 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-07-21 08:53:21,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 0 states have call successors, (0), 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-07-21 08:53:21,470 INFO L186 Difference]: Start difference. First operand has 325 places, 383 transitions, 810 flow. Second operand 3 states and 1007 transitions. [2022-07-21 08:53:21,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 325 transitions, 732 flow [2022-07-21 08:53:21,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 325 transitions, 732 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 08:53:21,474 INFO L242 Difference]: Finished difference. Result has 323 places, 322 transitions, 698 flow [2022-07-21 08:53:21,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=323, PETRI_TRANSITIONS=322} [2022-07-21 08:53:21,476 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -2 predicate places. [2022-07-21 08:53:21,476 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 322 transitions, 698 flow [2022-07-21 08:53:21,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 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-07-21 08:53:21,476 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:53:21,476 INFO L200 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] [2022-07-21 08:53:21,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:53:21,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-21 08:53:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:53:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -748866388, now seen corresponding path program 1 times [2022-07-21 08:53:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:53:21,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31628315] [2022-07-21 08:53:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:53:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:53:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:53:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:53:21,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:53:21,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31628315] [2022-07-21 08:53:21,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31628315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:53:21,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:53:21,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:53:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688052656] [2022-07-21 08:53:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:53:21,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:53:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:53:21,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:53:21,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:53:21,577 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 383 [2022-07-21 08:53:21,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 322 transitions, 698 flow. Second operand has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 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-07-21 08:53:21,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:53:21,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 383 [2022-07-21 08:53:21,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand