./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/weaver/popl20-more-mts.wvr.c -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 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:35:37,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:35:37,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:35:37,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:35:37,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:35:37,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:35:37,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:35:37,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:35:37,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:35:37,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:35:37,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:35:37,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:35:37,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:35:37,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:35:37,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:35:37,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:35:37,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:35:37,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:35:37,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:35:37,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:35:37,668 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:35:37,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:35:37,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:35:37,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:35:37,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:35:37,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:35:37,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:35:37,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:35:37,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:35:37,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:35:37,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:35:37,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:35:37,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:35:37,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:35:37,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:35:37,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:35:37,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:35:37,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:35:37,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:35:37,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:35:37,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:35:37,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:35:37,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:35:37,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:35:37,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:35:37,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:35:37,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:35:37,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:35:37,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:35:37,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:35:37,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:35:37,731 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:35:37,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:35:37,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:35:37,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:35:37,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:35:37,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:35:37,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:35:37,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:35:37,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:35:37,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:35:37,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:35:37,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:35:37,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:35:37,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:35:37,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:35:37,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:35:37,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:35:37,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:35:37,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:35:37,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:35:37,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:35:37,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:35:37,737 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:35:37,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:35:37,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:35:37,737 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 -> 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f [2022-07-12 10:35:37,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:35:38,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:35:38,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:35:38,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:35:38,022 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:35:38,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-07-12 10:35:38,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab771a737/ddab1644d7e14ef28a26ba57c3598884/FLAGf38da94d1 [2022-07-12 10:35:38,488 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:35:38,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-07-12 10:35:38,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab771a737/ddab1644d7e14ef28a26ba57c3598884/FLAGf38da94d1 [2022-07-12 10:35:38,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab771a737/ddab1644d7e14ef28a26ba57c3598884 [2022-07-12 10:35:38,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:35:38,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:35:38,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:35:38,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:35:38,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:35:38,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:35:38" (1/1) ... [2022-07-12 10:35:38,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718e606a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:38, skipping insertion in model container [2022-07-12 10:35:38,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:35:38" (1/1) ... [2022-07-12 10:35:38,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:35:38,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:35:39,096 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/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-07-12 10:35:39,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:35:39,115 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:35:39,153 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/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-07-12 10:35:39,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:35:39,173 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:35:39,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39 WrapperNode [2022-07-12 10:35:39,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:35:39,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:35:39,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:35:39,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:35:39,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,235 INFO L137 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 229 [2022-07-12 10:35:39,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:35:39,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:35:39,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:35:39,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:35:39,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:35:39,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:35:39,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:35:39,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:35:39,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (1/1) ... [2022-07-12 10:35:39,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:35:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:39,329 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-12 10:35:39,374 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-12 10:35:39,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:35:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:35:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:35:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:35:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:35:39,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:35:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:35:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:35:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:35:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:35:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:35:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:35:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:35:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:35:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:35:39,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:35:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:35:39,406 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:35:39,546 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:35:39,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:35:39,885 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:35:40,005 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:35:40,006 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 10:35:40,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:35:40 BoogieIcfgContainer [2022-07-12 10:35:40,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:35:40,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:35:40,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:35:40,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:35:40,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:35:38" (1/3) ... [2022-07-12 10:35:40,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d5df3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:35:40, skipping insertion in model container [2022-07-12 10:35:40,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:39" (2/3) ... [2022-07-12 10:35:40,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d5df3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:35:40, skipping insertion in model container [2022-07-12 10:35:40,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:35:40" (3/3) ... [2022-07-12 10:35:40,015 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2022-07-12 10:35:40,019 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:35:40,027 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:35:40,028 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:35:40,028 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:35:40,110 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:35:40,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 223 places, 232 transitions, 488 flow [2022-07-12 10:35:40,212 INFO L129 PetriNetUnfolder]: 19/229 cut-off events. [2022-07-12 10:35:40,213 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:35:40,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 229 events. 19/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 337 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-07-12 10:35:40,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 232 transitions, 488 flow [2022-07-12 10:35:40,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 218 transitions, 454 flow [2022-07-12 10:35:40,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:35:40,247 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@705a4472, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24c8750c [2022-07-12 10:35:40,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:35:40,292 INFO L129 PetriNetUnfolder]: 19/217 cut-off events. [2022-07-12 10:35:40,292 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:35:40,292 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:35:40,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1568340116, now seen corresponding path program 1 times [2022-07-12 10:35:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:40,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784552190] [2022-07-12 10:35:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:40,602 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-12 10:35:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784552190] [2022-07-12 10:35:40,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784552190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:35:40,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:35:40,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:35:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879367159] [2022-07-12 10:35:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:40,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:35:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:35:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:35:40,645 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232 [2022-07-12 10:35:40,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 218 transitions, 454 flow. Second operand has 2 states, 2 states have (on average 215.5) internal successors, (431), 2 states have internal predecessors, (431), 0 states have call successors, (0), 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-12 10:35:40,652 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:40,652 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232 [2022-07-12 10:35:40,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:40,730 INFO L129 PetriNetUnfolder]: 12/227 cut-off events. [2022-07-12 10:35:40,731 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-07-12 10:35:40,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 227 events. 12/227 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 455 event pairs, 2 based on Foata normal form. 25/235 useless extension candidates. Maximal degree in co-relation 178. Up to 15 conditions per place. [2022-07-12 10:35:40,737 INFO L132 encePairwiseOnDemand]: 220/232 looper letters, 7 selfloop transitions, 0 changer transitions 4/206 dead transitions. [2022-07-12 10:35:40,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 444 flow [2022-07-12 10:35:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:35:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:35:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 443 transitions. [2022-07-12 10:35:40,749 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9547413793103449 [2022-07-12 10:35:40,750 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 443 transitions. [2022-07-12 10:35:40,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 443 transitions. [2022-07-12 10:35:40,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:40,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 443 transitions. [2022-07-12 10:35:40,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 221.5) internal successors, (443), 2 states have internal predecessors, (443), 0 states have call successors, (0), 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-12 10:35:40,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-12 10:35:40,761 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-12 10:35:40,763 INFO L186 Difference]: Start difference. First operand has 209 places, 218 transitions, 454 flow. Second operand 2 states and 443 transitions. [2022-07-12 10:35:40,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 444 flow [2022-07-12 10:35:40,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 206 transitions, 432 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-12 10:35:40,770 INFO L242 Difference]: Finished difference. Result has 204 places, 202 transitions, 410 flow [2022-07-12 10:35:40,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=410, PETRI_PLACES=204, PETRI_TRANSITIONS=202} [2022-07-12 10:35:40,775 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -5 predicate places. [2022-07-12 10:35:40,775 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 202 transitions, 410 flow [2022-07-12 10:35:40,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 215.5) internal successors, (431), 2 states have internal predecessors, (431), 0 states have call successors, (0), 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-12 10:35:40,776 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:40,776 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, 1, 1, 1, 1, 1, 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-12 10:35:40,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:35:40,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1671150115, now seen corresponding path program 1 times [2022-07-12 10:35:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:40,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703624200] [2022-07-12 10:35:40,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:41,066 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-12 10:35:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703624200] [2022-07-12 10:35:41,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703624200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:35:41,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:35:41,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:35:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791940121] [2022-07-12 10:35:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:41,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:35:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:41,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:35:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:35:41,074 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 232 [2022-07-12 10:35:41,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 202 transitions, 410 flow. Second operand has 8 states, 8 states have (on average 175.5) internal successors, (1404), 8 states have internal predecessors, (1404), 0 states have call successors, (0), 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-12 10:35:41,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:41,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 232 [2022-07-12 10:35:41,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:41,405 INFO L129 PetriNetUnfolder]: 195/830 cut-off events. [2022-07-12 10:35:41,405 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-07-12 10:35:41,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 830 events. 195/830 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4266 event pairs, 92 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 1127. Up to 270 conditions per place. [2022-07-12 10:35:41,413 INFO L132 encePairwiseOnDemand]: 222/232 looper letters, 42 selfloop transitions, 6 changer transitions 4/210 dead transitions. [2022-07-12 10:35:41,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 210 transitions, 530 flow [2022-07-12 10:35:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:35:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:35:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1421 transitions. [2022-07-12 10:35:41,419 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.765625 [2022-07-12 10:35:41,419 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1421 transitions. [2022-07-12 10:35:41,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1421 transitions. [2022-07-12 10:35:41,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:41,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1421 transitions. [2022-07-12 10:35:41,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 177.625) internal successors, (1421), 8 states have internal predecessors, (1421), 0 states have call successors, (0), 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-12 10:35:41,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12 10:35:41,429 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12 10:35:41,429 INFO L186 Difference]: Start difference. First operand has 204 places, 202 transitions, 410 flow. Second operand 8 states and 1421 transitions. [2022-07-12 10:35:41,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 210 transitions, 530 flow [2022-07-12 10:35:41,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 210 transitions, 530 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:35:41,435 INFO L242 Difference]: Finished difference. Result has 211 places, 203 transitions, 438 flow [2022-07-12 10:35:41,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=438, PETRI_PLACES=211, PETRI_TRANSITIONS=203} [2022-07-12 10:35:41,436 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 2 predicate places. [2022-07-12 10:35:41,436 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 203 transitions, 438 flow [2022-07-12 10:35:41,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 175.5) internal successors, (1404), 8 states have internal predecessors, (1404), 0 states have call successors, (0), 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-12 10:35:41,437 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:41,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:35:41,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:35:41,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1212350603, now seen corresponding path program 1 times [2022-07-12 10:35:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:41,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747135336] [2022-07-12 10:35:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:41,608 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-12 10:35:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:41,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747135336] [2022-07-12 10:35:41,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747135336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:41,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120211438] [2022-07-12 10:35:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:41,613 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-12 10:35:41,615 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-12 10:35:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:41,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:35:41,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:41,870 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-12 10:35:41,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:35:42,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120211438] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:42,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:35:42,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-12 10:35:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307420989] [2022-07-12 10:35:42,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:42,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:35:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:42,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:35:42,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:35:42,057 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 232 [2022-07-12 10:35:42,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 203 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 191.42857142857142) internal successors, (1340), 7 states have internal predecessors, (1340), 0 states have call successors, (0), 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-12 10:35:42,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:42,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 232 [2022-07-12 10:35:42,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:42,220 INFO L129 PetriNetUnfolder]: 66/501 cut-off events. [2022-07-12 10:35:42,220 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-12 10:35:42,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 501 events. 66/501 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1806 event pairs, 16 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 662. Up to 61 conditions per place. [2022-07-12 10:35:42,229 INFO L132 encePairwiseOnDemand]: 224/232 looper letters, 32 selfloop transitions, 7 changer transitions 0/210 dead transitions. [2022-07-12 10:35:42,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 210 transitions, 532 flow [2022-07-12 10:35:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:35:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:35:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1355 transitions. [2022-07-12 10:35:42,257 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8343596059113301 [2022-07-12 10:35:42,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1355 transitions. [2022-07-12 10:35:42,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1355 transitions. [2022-07-12 10:35:42,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:42,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1355 transitions. [2022-07-12 10:35:42,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 193.57142857142858) internal successors, (1355), 7 states have internal predecessors, (1355), 0 states have call successors, (0), 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-12 10:35:42,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 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-12 10:35:42,268 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 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-12 10:35:42,268 INFO L186 Difference]: Start difference. First operand has 211 places, 203 transitions, 438 flow. Second operand 7 states and 1355 transitions. [2022-07-12 10:35:42,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 210 transitions, 532 flow [2022-07-12 10:35:42,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 210 transitions, 514 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-12 10:35:42,273 INFO L242 Difference]: Finished difference. Result has 211 places, 205 transitions, 453 flow [2022-07-12 10:35:42,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=453, PETRI_PLACES=211, PETRI_TRANSITIONS=205} [2022-07-12 10:35:42,276 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 2 predicate places. [2022-07-12 10:35:42,276 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 205 transitions, 453 flow [2022-07-12 10:35:42,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 191.42857142857142) internal successors, (1340), 7 states have internal predecessors, (1340), 0 states have call successors, (0), 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-12 10:35:42,277 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:42,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:35:42,305 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-12 10:35:42,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:42,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1906020565, now seen corresponding path program 1 times [2022-07-12 10:35:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:42,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442942670] [2022-07-12 10:35:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:42,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:42,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442942670] [2022-07-12 10:35:42,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442942670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:42,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586506400] [2022-07-12 10:35:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:42,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:42,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:42,668 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-12 10:35:42,669 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-12 10:35:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:42,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:35:42,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:42,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:43,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586506400] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:43,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:35:43,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-12 10:35:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753350221] [2022-07-12 10:35:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:43,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:35:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:43,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:35:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:35:43,087 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 232 [2022-07-12 10:35:43,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 205 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 184.22222222222223) internal successors, (1658), 9 states have internal predecessors, (1658), 0 states have call successors, (0), 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-12 10:35:43,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:43,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 232 [2022-07-12 10:35:43,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:43,437 INFO L129 PetriNetUnfolder]: 558/1457 cut-off events. [2022-07-12 10:35:43,438 INFO L130 PetriNetUnfolder]: For 457/629 co-relation queries the response was YES. [2022-07-12 10:35:43,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1457 events. 558/1457 cut-off events. For 457/629 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8635 event pairs, 110 based on Foata normal form. 172/1358 useless extension candidates. Maximal degree in co-relation 2658. Up to 208 conditions per place. [2022-07-12 10:35:43,453 INFO L132 encePairwiseOnDemand]: 220/232 looper letters, 71 selfloop transitions, 19 changer transitions 0/254 dead transitions. [2022-07-12 10:35:43,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 254 transitions, 780 flow [2022-07-12 10:35:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:35:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:35:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2075 transitions. [2022-07-12 10:35:43,459 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8130877742946708 [2022-07-12 10:35:43,459 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2075 transitions. [2022-07-12 10:35:43,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2075 transitions. [2022-07-12 10:35:43,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:43,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2075 transitions. [2022-07-12 10:35:43,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 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-12 10:35:43,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 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-12 10:35:43,470 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 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-12 10:35:43,470 INFO L186 Difference]: Start difference. First operand has 211 places, 205 transitions, 453 flow. Second operand 11 states and 2075 transitions. [2022-07-12 10:35:43,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 254 transitions, 780 flow [2022-07-12 10:35:43,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 254 transitions, 767 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:35:43,476 INFO L242 Difference]: Finished difference. Result has 223 places, 217 transitions, 552 flow [2022-07-12 10:35:43,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=552, PETRI_PLACES=223, PETRI_TRANSITIONS=217} [2022-07-12 10:35:43,477 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 14 predicate places. [2022-07-12 10:35:43,477 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 217 transitions, 552 flow [2022-07-12 10:35:43,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 184.22222222222223) internal successors, (1658), 9 states have internal predecessors, (1658), 0 states have call successors, (0), 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-12 10:35:43,478 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:43,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:35:43,502 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-12 10:35:43,693 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,SelfDestructingSolverStorable3 [2022-07-12 10:35:43,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1224231907, now seen corresponding path program 2 times [2022-07-12 10:35:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:43,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798393683] [2022-07-12 10:35:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:43,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798393683] [2022-07-12 10:35:43,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798393683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199953540] [2022-07-12 10:35:43,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:35:43,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:43,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:43,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:35:43,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:35:43,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:35:43,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:35:43,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 10:35:43,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:35:44,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:35:44,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199953540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:35:44,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:35:44,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-12 10:35:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35831199] [2022-07-12 10:35:44,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:44,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:35:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:35:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:35:44,240 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 232 [2022-07-12 10:35:44,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 217 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 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-12 10:35:44,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:44,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 232 [2022-07-12 10:35:44,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:44,595 INFO L129 PetriNetUnfolder]: 283/1226 cut-off events. [2022-07-12 10:35:44,595 INFO L130 PetriNetUnfolder]: For 584/662 co-relation queries the response was YES. [2022-07-12 10:35:44,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2150 conditions, 1226 events. 283/1226 cut-off events. For 584/662 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6508 event pairs, 66 based on Foata normal form. 91/1215 useless extension candidates. Maximal degree in co-relation 2136. Up to 217 conditions per place. [2022-07-12 10:35:44,610 INFO L132 encePairwiseOnDemand]: 223/232 looper letters, 38 selfloop transitions, 11 changer transitions 0/217 dead transitions. [2022-07-12 10:35:44,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 217 transitions, 639 flow [2022-07-12 10:35:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:35:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:35:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1469 transitions. [2022-07-12 10:35:44,615 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7914870689655172 [2022-07-12 10:35:44,615 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1469 transitions. [2022-07-12 10:35:44,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1469 transitions. [2022-07-12 10:35:44,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:44,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1469 transitions. [2022-07-12 10:35:44,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 183.625) internal successors, (1469), 8 states have internal predecessors, (1469), 0 states have call successors, (0), 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-12 10:35:44,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12 10:35:44,624 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12 10:35:44,624 INFO L186 Difference]: Start difference. First operand has 223 places, 217 transitions, 552 flow. Second operand 8 states and 1469 transitions. [2022-07-12 10:35:44,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 217 transitions, 639 flow [2022-07-12 10:35:44,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 217 transitions, 626 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-12 10:35:44,633 INFO L242 Difference]: Finished difference. Result has 222 places, 211 transitions, 529 flow [2022-07-12 10:35:44,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=529, PETRI_PLACES=222, PETRI_TRANSITIONS=211} [2022-07-12 10:35:44,636 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 13 predicate places. [2022-07-12 10:35:44,636 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 211 transitions, 529 flow [2022-07-12 10:35:44,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 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-12 10:35:44,637 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:44,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:35:44,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:35:44,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:44,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 57013380, now seen corresponding path program 1 times [2022-07-12 10:35:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:44,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575094609] [2022-07-12 10:35:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:45,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575094609] [2022-07-12 10:35:45,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575094609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:45,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741041383] [2022-07-12 10:35:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:45,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:45,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:46,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:35:46,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:35:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:46,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 10:35:46,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:48,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:35:48,213 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:48,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 31 [2022-07-12 10:35:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:35:48,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:49,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:49,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 32 [2022-07-12 10:35:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:35:50,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741041383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:35:50,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:35:50,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 28] total 82 [2022-07-12 10:35:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178999886] [2022-07-12 10:35:50,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:35:50,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-12 10:35:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-12 10:35:50,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=6235, Unknown=0, NotChecked=0, Total=6642 [2022-07-12 10:35:50,136 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 232 [2022-07-12 10:35:50,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 211 transitions, 529 flow. Second operand has 82 states, 82 states have (on average 118.07317073170732) internal successors, (9682), 82 states have internal predecessors, (9682), 0 states have call successors, (0), 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-12 10:35:50,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:50,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 232 [2022-07-12 10:35:50,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:36:46,560 INFO L129 PetriNetUnfolder]: 89768/174028 cut-off events. [2022-07-12 10:36:46,561 INFO L130 PetriNetUnfolder]: For 105640/105640 co-relation queries the response was YES. [2022-07-12 10:36:47,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373874 conditions, 174028 events. 89768/174028 cut-off events. For 105640/105640 co-relation queries the response was YES. Maximal size of possible extension queue 2771. Compared 1890781 event pairs, 6373 based on Foata normal form. 2059/167370 useless extension candidates. Maximal degree in co-relation 373862. Up to 16455 conditions per place. [2022-07-12 10:36:48,106 INFO L132 encePairwiseOnDemand]: 172/232 looper letters, 2817 selfloop transitions, 912 changer transitions 25/3856 dead transitions. [2022-07-12 10:36:48,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 3856 transitions, 19586 flow [2022-07-12 10:36:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2022-07-12 10:36:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2022-07-12 10:36:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 35591 transitions. [2022-07-12 10:36:48,165 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5518326717935996 [2022-07-12 10:36:48,165 INFO L72 ComplementDD]: Start complementDD. Operand 278 states and 35591 transitions. [2022-07-12 10:36:48,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 35591 transitions. [2022-07-12 10:36:48,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:36:48,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 278 states and 35591 transitions. [2022-07-12 10:36:48,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 279 states, 278 states have (on average 128.0251798561151) internal successors, (35591), 278 states have internal predecessors, (35591), 0 states have call successors, (0), 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-12 10:36:48,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 279 states, 279 states have (on average 232.0) internal successors, (64728), 279 states have internal predecessors, (64728), 0 states have call successors, (0), 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-12 10:36:48,381 INFO L81 ComplementDD]: Finished complementDD. Result has 279 states, 279 states have (on average 232.0) internal successors, (64728), 279 states have internal predecessors, (64728), 0 states have call successors, (0), 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-12 10:36:48,382 INFO L186 Difference]: Start difference. First operand has 222 places, 211 transitions, 529 flow. Second operand 278 states and 35591 transitions. [2022-07-12 10:36:48,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 3856 transitions, 19586 flow [2022-07-12 10:36:51,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 3856 transitions, 19279 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-12 10:36:51,752 INFO L242 Difference]: Finished difference. Result has 715 places, 1240 transitions, 8477 flow [2022-07-12 10:36:51,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=278, PETRI_FLOW=8477, PETRI_PLACES=715, PETRI_TRANSITIONS=1240} [2022-07-12 10:36:51,753 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 506 predicate places. [2022-07-12 10:36:51,753 INFO L495 AbstractCegarLoop]: Abstraction has has 715 places, 1240 transitions, 8477 flow [2022-07-12 10:36:51,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 118.07317073170732) internal successors, (9682), 82 states have internal predecessors, (9682), 0 states have call successors, (0), 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-12 10:36:51,757 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:36:51,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:36:51,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 10:36:51,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:36:51,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:36:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:36:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash -92300446, now seen corresponding path program 2 times [2022-07-12 10:36:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:36:51,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034846029] [2022-07-12 10:36:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:36:51,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:36:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:36:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:36:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:36:53,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034846029] [2022-07-12 10:36:53,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034846029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:36:53,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547884318] [2022-07-12 10:36:53,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:36:53,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:36:53,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:36:53,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:36:53,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:36:53,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:36:53,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:36:53,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 10:36:53,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:36:54,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 10:36:54,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:36:54,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:36:55,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:36:55,303 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-12 10:36:55,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:55,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 40 [2022-07-12 10:36:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:36:55,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:36:56,606 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (= c_~mts1~0 .cse0) (< .cse0 0)))) (or (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (not (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))) 0)))) (= c_~mts1~0 0))) is different from false [2022-07-12 10:36:56,879 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_thread1Thread1of1ForFork1_#t~ite5#1| 0) (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (not (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))) 0))))) (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= |c_thread1Thread1of1ForFork1_#t~ite5#1| .cse0) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (< .cse0 0))))) is different from false [2022-07-12 10:36:56,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= .cse0 0) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (< .cse0 0)))) is different from false [2022-07-12 10:36:56,911 WARN L833 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork1_#t~ret3#1| 0)) (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= .cse0 0) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (< .cse0 0))))) is different from false [2022-07-12 10:36:57,356 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= .cse0 0) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (< .cse0 0)))) (<= 0 (+ |c_thread1Thread1of1ForFork1_plus_#in~b#1| |c_thread1Thread1of1ForFork1_plus_#in~a#1|))) is different from false [2022-07-12 10:36:57,499 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= .cse0 0) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) c_~N~0) (< .cse0 0)))) (<= 0 (+ (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) c_~mts1~0))) is different from false [2022-07-12 10:36:57,528 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_193 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (<= (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) |c_thread1Thread1of1ForFork1_~i~0#1|) (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= .cse0 0) (< .cse0 0)))) (<= 0 (+ (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) c_~mts1~0))) is different from false [2022-07-12 10:36:57,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192))) (let ((.cse0 (+ c_~mts3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (<= (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) |c_thread1Thread1of1ForFork1_~i~0#1|) (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= .cse0 0) (<= 0 (+ c_~mts1~0 (select (select .cse1 c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)))) (< .cse0 0))))) is different from false [2022-07-12 10:36:57,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192))) (let ((.cse0 (+ c_~mts3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (= .cse0 0) (<= (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) 0) (<= 0 (+ c_~mts1~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (< .cse0 0))))) is different from false [2022-07-12 10:36:57,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192))) (let ((.cse0 (+ c_~mts3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (<= (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) 0) (= .cse0 0) (< .cse0 0) (<= 0 (+ c_~mts1~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-07-12 10:36:57,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192))) (let ((.cse0 (+ c_~mts3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret20#1.base|) (+ |c_ULTIMATE.start_main_#t~ret20#1.offset| (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4)))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (<= (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) 0) (= .cse0 0) (< .cse0 0) (<= 0 (+ c_~mts1~0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret20#1.base|) |c_ULTIMATE.start_main_#t~ret20#1.offset|))))))) is different from false [2022-07-12 10:36:57,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192))) (let ((.cse1 (+ c_~mts3~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (or (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (<= (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) 0) (<= 0 (+ c_~mts1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse1 0) (< .cse1 0))))) is different from false [2022-07-12 10:36:57,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_23| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192))) (let ((.cse0 (+ c_~mts3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_23| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (< .cse0 0) (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_23|) (<= (+ |v_thread3Thread1of1ForFork0_~i~2#1_23| 1) 0) (<= 0 (+ c_~mts1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse0 0))))) is different from false [2022-07-12 10:36:57,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:57,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 72 [2022-07-12 10:36:57,916 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:36:57,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 378 treesize of output 362 [2022-07-12 10:36:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:36:57,928 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 171 [2022-07-12 10:36:57,938 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:36:57,939 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 344 treesize of output 320 [2022-07-12 10:36:57,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 267 treesize of output 219 [2022-07-12 10:36:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 10:36:58,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547884318] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:36:58,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:36:58,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37, 35] total 103 [2022-07-12 10:36:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467178678] [2022-07-12 10:36:58,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:36:58,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-07-12 10:36:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:36:58,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-07-12 10:36:58,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=7250, Unknown=59, NotChecked=2444, Total=10506 [2022-07-12 10:36:58,597 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 232 [2022-07-12 10:36:58,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 1240 transitions, 8477 flow. Second operand has 103 states, 103 states have (on average 107.54368932038835) internal successors, (11077), 103 states have internal predecessors, (11077), 0 states have call successors, (0), 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-12 10:36:58,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:36:58,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 232 [2022-07-12 10:36:58,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand