./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-bad-counter-queue2.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 7c615a04683f0f8050243ec529c03e20511a5c93f5e823175650f11e9fefc562 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:31:11,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:31:11,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:31:11,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:31:11,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:31:11,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:31:11,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:31:11,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:31:11,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:31:11,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:31:11,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:31:11,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:31:11,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:31:11,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:31:11,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:31:11,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:31:11,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:31:11,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:31:11,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:31:11,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:31:11,171 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:31:11,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:31:11,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:31:11,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:31:11,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:31:11,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:31:11,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:31:11,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:31:11,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:31:11,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:31:11,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:31:11,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:31:11,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:31:11,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:31:11,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:31:11,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:31:11,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:31:11,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:31:11,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:31:11,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:31:11,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:31:11,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:31:11,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:31:11,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:31:11,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:31:11,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:31:11,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:31:11,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:31:11,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:31:11,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:31:11,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:31:11,199 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:31:11,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:31:11,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:31:11,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:31:11,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:31:11,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:31:11,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:31:11,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:31:11,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:31:11,201 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:31:11,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:31:11,201 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:31:11,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:31:11,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:31:11,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:31:11,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:31:11,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:31:11,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:31:11,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:31:11,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:31:11,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:31:11,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:31:11,203 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:31:11,203 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:31:11,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:31:11,203 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 -> 7c615a04683f0f8050243ec529c03e20511a5c93f5e823175650f11e9fefc562 [2022-07-19 21:31:11,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:31:11,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:31:11,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:31:11,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:31:11,407 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:31:11,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-19 21:31:11,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f914b91/031c8fdbbaad43ea96efdac27dada434/FLAG6a37fa525 [2022-07-19 21:31:11,805 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:31:11,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-19 21:31:11,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f914b91/031c8fdbbaad43ea96efdac27dada434/FLAG6a37fa525 [2022-07-19 21:31:11,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f914b91/031c8fdbbaad43ea96efdac27dada434 [2022-07-19 21:31:11,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:31:11,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:31:11,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:31:11,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:31:11,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:31:11,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:31:11" (1/1) ... [2022-07-19 21:31:11,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3440046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:11, skipping insertion in model container [2022-07-19 21:31:11,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:31:11" (1/1) ... [2022-07-19 21:31:11,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:31:11,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:31:12,019 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-bad-counter-queue2.wvr.c[2271,2284] [2022-07-19 21:31:12,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:31:12,038 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:31:12,072 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-bad-counter-queue2.wvr.c[2271,2284] [2022-07-19 21:31:12,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:31:12,090 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:31:12,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12 WrapperNode [2022-07-19 21:31:12,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:31:12,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:31:12,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:31:12,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:31:12,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,141 INFO L137 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 138 [2022-07-19 21:31:12,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:31:12,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:31:12,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:31:12,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:31:12,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:31:12,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:31:12,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:31:12,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:31:12,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (1/1) ... [2022-07-19 21:31:12,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:31:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:12,241 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-19 21:31:12,243 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-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-19 21:31:12,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-19 21:31:12,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:31:12,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:31:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:31:12,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:31:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:31:12,292 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:31:12,366 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:31:12,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:31:12,536 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:31:12,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:31:12,616 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 21:31:12,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:31:12 BoogieIcfgContainer [2022-07-19 21:31:12,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:31:12,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:31:12,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:31:12,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:31:12,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:31:11" (1/3) ... [2022-07-19 21:31:12,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ecc1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:31:12, skipping insertion in model container [2022-07-19 21:31:12,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:12" (2/3) ... [2022-07-19 21:31:12,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ecc1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:31:12, skipping insertion in model container [2022-07-19 21:31:12,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:31:12" (3/3) ... [2022-07-19 21:31:12,630 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2022-07-19 21:31:12,633 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:31:12,643 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:31:12,643 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:31:12,643 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:31:12,698 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-19 21:31:12,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 117 transitions, 250 flow [2022-07-19 21:31:12,755 INFO L129 PetriNetUnfolder]: 9/115 cut-off events. [2022-07-19 21:31:12,755 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:31:12,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 115 events. 9/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-07-19 21:31:12,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 117 transitions, 250 flow [2022-07-19 21:31:12,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 106 transitions, 224 flow [2022-07-19 21:31:12,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:31:12,771 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@5f24b6d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77b0b8e2 [2022-07-19 21:31:12,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-19 21:31:12,795 INFO L129 PetriNetUnfolder]: 9/105 cut-off events. [2022-07-19 21:31:12,796 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:31:12,796 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:12,796 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] [2022-07-19 21:31:12,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1997616241, now seen corresponding path program 1 times [2022-07-19 21:31:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:12,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886502401] [2022-07-19 21:31:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:12,986 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-19 21:31:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886502401] [2022-07-19 21:31:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886502401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:31:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312779752] [2022-07-19 21:31:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:12,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 21:31:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 21:31:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:31:13,020 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2022-07-19 21:31:13,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 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-19 21:31:13,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:13,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2022-07-19 21:31:13,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:13,091 INFO L129 PetriNetUnfolder]: 12/133 cut-off events. [2022-07-19 21:31:13,091 INFO L130 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-07-19 21:31:13,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 133 events. 12/133 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 170 event pairs, 3 based on Foata normal form. 13/135 useless extension candidates. Maximal degree in co-relation 78. Up to 19 conditions per place. [2022-07-19 21:31:13,094 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 6 selfloop transitions, 0 changer transitions 3/100 dead transitions. [2022-07-19 21:31:13,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 224 flow [2022-07-19 21:31:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 21:31:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 21:31:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 220 transitions. [2022-07-19 21:31:13,105 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-07-19 21:31:13,105 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 220 transitions. [2022-07-19 21:31:13,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 220 transitions. [2022-07-19 21:31:13,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:13,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 220 transitions. [2022-07-19 21:31:13,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 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-19 21:31:13,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-19 21:31:13,119 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-19 21:31:13,120 INFO L186 Difference]: Start difference. First operand has 104 places, 106 transitions, 224 flow. Second operand 2 states and 220 transitions. [2022-07-19 21:31:13,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 224 flow [2022-07-19 21:31:13,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:31:13,127 INFO L242 Difference]: Finished difference. Result has 101 places, 97 transitions, 198 flow [2022-07-19 21:31:13,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=198, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2022-07-19 21:31:13,133 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -3 predicate places. [2022-07-19 21:31:13,133 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 198 flow [2022-07-19 21:31:13,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 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-19 21:31:13,134 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:13,134 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] [2022-07-19 21:31:13,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:31:13,134 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1204015377, now seen corresponding path program 1 times [2022-07-19 21:31:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:13,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245516350] [2022-07-19 21:31:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:13,328 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-19 21:31:13,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:13,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245516350] [2022-07-19 21:31:13,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245516350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:13,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:13,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152955787] [2022-07-19 21:31:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:13,331 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-07-19 21:31:13,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 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-19 21:31:13,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:13,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-07-19 21:31:13,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:13,388 INFO L129 PetriNetUnfolder]: 13/150 cut-off events. [2022-07-19 21:31:13,388 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-07-19 21:31:13,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 150 events. 13/150 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 252 event pairs, 0 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 192. Up to 24 conditions per place. [2022-07-19 21:31:13,389 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 20 selfloop transitions, 3 changer transitions 4/105 dead transitions. [2022-07-19 21:31:13,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 271 flow [2022-07-19 21:31:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:31:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:31:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-07-19 21:31:13,392 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8 [2022-07-19 21:31:13,392 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2022-07-19 21:31:13,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2022-07-19 21:31:13,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:13,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2022-07-19 21:31:13,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 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-19 21:31:13,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:13,395 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:13,395 INFO L186 Difference]: Start difference. First operand has 101 places, 97 transitions, 198 flow. Second operand 5 states and 468 transitions. [2022-07-19 21:31:13,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 271 flow [2022-07-19 21:31:13,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:31:13,397 INFO L242 Difference]: Finished difference. Result has 105 places, 99 transitions, 221 flow [2022-07-19 21:31:13,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2022-07-19 21:31:13,398 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-07-19 21:31:13,398 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 221 flow [2022-07-19 21:31:13,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 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-19 21:31:13,398 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:13,399 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] [2022-07-19 21:31:13,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:31:13,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1430434687, now seen corresponding path program 1 times [2022-07-19 21:31:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:13,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61667290] [2022-07-19 21:31:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:13,471 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-19 21:31:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61667290] [2022-07-19 21:31:13,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61667290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:13,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:13,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:31:13,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119406329] [2022-07-19 21:31:13,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:13,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:31:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:31:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:31:13,474 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-19 21:31:13,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 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-19 21:31:13,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:13,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-19 21:31:13,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:13,634 INFO L129 PetriNetUnfolder]: 83/368 cut-off events. [2022-07-19 21:31:13,634 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-07-19 21:31:13,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 368 events. 83/368 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1527 event pairs, 34 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 615. Up to 125 conditions per place. [2022-07-19 21:31:13,639 INFO L132 encePairwiseOnDemand]: 108/117 looper letters, 41 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2022-07-19 21:31:13,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 374 flow [2022-07-19 21:31:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:31:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:31:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2022-07-19 21:31:13,642 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7585470085470085 [2022-07-19 21:31:13,642 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 710 transitions. [2022-07-19 21:31:13,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 710 transitions. [2022-07-19 21:31:13,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:13,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 710 transitions. [2022-07-19 21:31:13,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 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-19 21:31:13,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 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-19 21:31:13,648 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 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-19 21:31:13,648 INFO L186 Difference]: Start difference. First operand has 105 places, 99 transitions, 221 flow. Second operand 8 states and 710 transitions. [2022-07-19 21:31:13,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 119 transitions, 374 flow [2022-07-19 21:31:13,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 119 transitions, 365 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-19 21:31:13,654 INFO L242 Difference]: Finished difference. Result has 110 places, 102 transitions, 250 flow [2022-07-19 21:31:13,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=250, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2022-07-19 21:31:13,655 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 6 predicate places. [2022-07-19 21:31:13,656 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 250 flow [2022-07-19 21:31:13,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 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-19 21:31:13,656 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:13,657 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] [2022-07-19 21:31:13,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:31:13,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:13,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -852119249, now seen corresponding path program 1 times [2022-07-19 21:31:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:13,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262890433] [2022-07-19 21:31:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:13,780 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-19 21:31:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:13,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262890433] [2022-07-19 21:31:13,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262890433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:13,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:13,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:31:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385267277] [2022-07-19 21:31:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:13,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:31:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:31:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:31:13,786 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-19 21:31:13,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 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-19 21:31:13,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:13,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-19 21:31:13,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:13,895 INFO L129 PetriNetUnfolder]: 67/286 cut-off events. [2022-07-19 21:31:13,895 INFO L130 PetriNetUnfolder]: For 51/54 co-relation queries the response was YES. [2022-07-19 21:31:13,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 286 events. 67/286 cut-off events. For 51/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1018 event pairs, 36 based on Foata normal form. 3/268 useless extension candidates. Maximal degree in co-relation 502. Up to 124 conditions per place. [2022-07-19 21:31:13,898 INFO L132 encePairwiseOnDemand]: 108/117 looper letters, 27 selfloop transitions, 6 changer transitions 11/114 dead transitions. [2022-07-19 21:31:13,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 114 transitions, 365 flow [2022-07-19 21:31:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:31:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:31:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 706 transitions. [2022-07-19 21:31:13,899 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7542735042735043 [2022-07-19 21:31:13,900 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 706 transitions. [2022-07-19 21:31:13,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 706 transitions. [2022-07-19 21:31:13,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:13,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 706 transitions. [2022-07-19 21:31:13,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 0 states have call successors, (0), 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-19 21:31:13,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 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-19 21:31:13,906 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 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-19 21:31:13,906 INFO L186 Difference]: Start difference. First operand has 110 places, 102 transitions, 250 flow. Second operand 8 states and 706 transitions. [2022-07-19 21:31:13,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 114 transitions, 365 flow [2022-07-19 21:31:13,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:31:13,911 INFO L242 Difference]: Finished difference. Result has 115 places, 100 transitions, 244 flow [2022-07-19 21:31:13,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2022-07-19 21:31:13,912 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2022-07-19 21:31:13,916 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 244 flow [2022-07-19 21:31:13,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 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-19 21:31:13,917 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:13,917 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] [2022-07-19 21:31:13,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:31:13,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1474470436, now seen corresponding path program 1 times [2022-07-19 21:31:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:13,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652082656] [2022-07-19 21:31:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:14,001 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-19 21:31:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:14,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652082656] [2022-07-19 21:31:14,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652082656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:14,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410080607] [2022-07-19 21:31:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:14,004 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-19 21:31:14,005 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-19 21:31:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:14,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:31:14,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:14,192 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-19 21:31:14,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:14,310 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-19 21:31:14,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410080607] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:14,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:31:14,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-19 21:31:14,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668776121] [2022-07-19 21:31:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:14,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:31:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:14,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:31:14,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:31:14,313 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-19 21:31:14,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 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-19 21:31:14,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:14,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-19 21:31:14,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:14,385 INFO L129 PetriNetUnfolder]: 58/226 cut-off events. [2022-07-19 21:31:14,385 INFO L130 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-07-19 21:31:14,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 226 events. 58/226 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 641 event pairs, 13 based on Foata normal form. 8/229 useless extension candidates. Maximal degree in co-relation 432. Up to 65 conditions per place. [2022-07-19 21:31:14,386 INFO L132 encePairwiseOnDemand]: 109/117 looper letters, 30 selfloop transitions, 7 changer transitions 0/107 dead transitions. [2022-07-19 21:31:14,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 107 transitions, 341 flow [2022-07-19 21:31:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:31:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:31:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 615 transitions. [2022-07-19 21:31:14,388 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7509157509157509 [2022-07-19 21:31:14,388 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 615 transitions. [2022-07-19 21:31:14,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 615 transitions. [2022-07-19 21:31:14,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:14,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 615 transitions. [2022-07-19 21:31:14,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 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-19 21:31:14,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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-19 21:31:14,391 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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-19 21:31:14,391 INFO L186 Difference]: Start difference. First operand has 115 places, 100 transitions, 244 flow. Second operand 7 states and 615 transitions. [2022-07-19 21:31:14,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 107 transitions, 341 flow [2022-07-19 21:31:14,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 315 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-07-19 21:31:14,393 INFO L242 Difference]: Finished difference. Result has 111 places, 102 transitions, 255 flow [2022-07-19 21:31:14,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2022-07-19 21:31:14,394 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2022-07-19 21:31:14,394 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 255 flow [2022-07-19 21:31:14,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 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-19 21:31:14,395 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:14,395 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] [2022-07-19 21:31:14,414 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-19 21:31:14,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:14,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1354192604, now seen corresponding path program 1 times [2022-07-19 21:31:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:14,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189696443] [2022-07-19 21:31:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:14,672 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-19 21:31:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189696443] [2022-07-19 21:31:14,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189696443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000403045] [2022-07-19 21:31:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:14,675 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-19 21:31:14,676 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-19 21:31:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:14,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:31:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:14,838 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-19 21:31:14,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:14,950 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-19 21:31:14,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000403045] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:14,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:31:14,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-19 21:31:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400407888] [2022-07-19 21:31:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:14,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:31:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:31:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:31:14,952 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-19 21:31:14,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 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-19 21:31:14,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:14,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-19 21:31:14,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:15,034 INFO L129 PetriNetUnfolder]: 46/209 cut-off events. [2022-07-19 21:31:15,035 INFO L130 PetriNetUnfolder]: For 65/80 co-relation queries the response was YES. [2022-07-19 21:31:15,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 209 events. 46/209 cut-off events. For 65/80 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 523 event pairs, 9 based on Foata normal form. 15/211 useless extension candidates. Maximal degree in co-relation 397. Up to 54 conditions per place. [2022-07-19 21:31:15,037 INFO L132 encePairwiseOnDemand]: 109/117 looper letters, 32 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2022-07-19 21:31:15,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 360 flow [2022-07-19 21:31:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:31:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:31:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 615 transitions. [2022-07-19 21:31:15,039 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7509157509157509 [2022-07-19 21:31:15,040 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 615 transitions. [2022-07-19 21:31:15,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 615 transitions. [2022-07-19 21:31:15,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:15,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 615 transitions. [2022-07-19 21:31:15,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 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-19 21:31:15,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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-19 21:31:15,043 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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-19 21:31:15,043 INFO L186 Difference]: Start difference. First operand has 111 places, 102 transitions, 255 flow. Second operand 7 states and 615 transitions. [2022-07-19 21:31:15,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 360 flow [2022-07-19 21:31:15,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 109 transitions, 351 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:31:15,048 INFO L242 Difference]: Finished difference. Result has 115 places, 103 transitions, 274 flow [2022-07-19 21:31:15,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=115, PETRI_TRANSITIONS=103} [2022-07-19 21:31:15,050 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2022-07-19 21:31:15,050 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 274 flow [2022-07-19 21:31:15,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 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-19 21:31:15,051 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:15,051 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] [2022-07-19 21:31:15,070 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-19 21:31:15,268 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,SelfDestructingSolverStorable5 [2022-07-19 21:31:15,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:15,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:15,268 INFO L85 PathProgramCache]: Analyzing trace with hash 62640818, now seen corresponding path program 1 times [2022-07-19 21:31:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:15,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620733690] [2022-07-19 21:31:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:15,494 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-19 21:31:15,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620733690] [2022-07-19 21:31:15,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620733690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134006263] [2022-07-19 21:31:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:15,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:15,497 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-19 21:31:15,498 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-19 21:31:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:15,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 21:31:15,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:15,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-19 21:31:15,734 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:31:15,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 21:31:15,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-19 21:31:15,900 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-19 21:31:15,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-19 21:31:15,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 21:31:16,038 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-19 21:31:16,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:16,300 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 10 treesize of output 8 [2022-07-19 21:31:16,307 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-19 21:31:16,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134006263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:16,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:16,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 9] total 30 [2022-07-19 21:31:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504024667] [2022-07-19 21:31:16,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:16,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 21:31:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 21:31:16,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2022-07-19 21:31:16,310 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 117 [2022-07-19 21:31:16,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 103 transitions, 274 flow. Second operand has 30 states, 30 states have (on average 49.266666666666666) internal successors, (1478), 30 states have internal predecessors, (1478), 0 states have call successors, (0), 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-19 21:31:16,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:16,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 117 [2022-07-19 21:31:16,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:17,029 INFO L129 PetriNetUnfolder]: 325/771 cut-off events. [2022-07-19 21:31:17,029 INFO L130 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2022-07-19 21:31:17,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 771 events. 325/771 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3846 event pairs, 99 based on Foata normal form. 1/761 useless extension candidates. Maximal degree in co-relation 1859. Up to 330 conditions per place. [2022-07-19 21:31:17,032 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 90 selfloop transitions, 29 changer transitions 4/162 dead transitions. [2022-07-19 21:31:17,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 162 transitions, 727 flow [2022-07-19 21:31:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 21:31:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-07-19 21:31:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1112 transitions. [2022-07-19 21:31:17,035 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.432012432012432 [2022-07-19 21:31:17,035 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1112 transitions. [2022-07-19 21:31:17,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1112 transitions. [2022-07-19 21:31:17,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:17,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1112 transitions. [2022-07-19 21:31:17,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 50.54545454545455) internal successors, (1112), 22 states have internal predecessors, (1112), 0 states have call successors, (0), 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-19 21:31:17,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 0 states have call successors, (0), 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-19 21:31:17,040 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 0 states have call successors, (0), 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-19 21:31:17,040 INFO L186 Difference]: Start difference. First operand has 115 places, 103 transitions, 274 flow. Second operand 22 states and 1112 transitions. [2022-07-19 21:31:17,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 162 transitions, 727 flow [2022-07-19 21:31:17,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 162 transitions, 709 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-19 21:31:17,043 INFO L242 Difference]: Finished difference. Result has 138 places, 118 transitions, 425 flow [2022-07-19 21:31:17,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=425, PETRI_PLACES=138, PETRI_TRANSITIONS=118} [2022-07-19 21:31:17,044 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 34 predicate places. [2022-07-19 21:31:17,044 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 425 flow [2022-07-19 21:31:17,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 49.266666666666666) internal successors, (1478), 30 states have internal predecessors, (1478), 0 states have call successors, (0), 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-19 21:31:17,044 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:17,044 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] [2022-07-19 21:31:17,063 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-19 21:31:17,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:17,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash -618781634, now seen corresponding path program 2 times [2022-07-19 21:31:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:17,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421103548] [2022-07-19 21:31:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:17,535 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-19 21:31:17,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:17,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421103548] [2022-07-19 21:31:17,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421103548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:17,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600762956] [2022-07-19 21:31:17,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:31:17,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:17,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:17,552 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-19 21:31:17,553 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-19 21:31:17,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:17,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:17,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 21:31:17,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:17,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-19 21:31:17,732 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:31:17,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 21:31:17,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-19 21:31:17,961 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-19 21:31:18,020 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 21 treesize of output 21 [2022-07-19 21:31:18,129 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-19 21:31:18,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:18,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (= (+ c_~counter~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-19 21:31:18,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-19 21:31:18,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (= 0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset))))) is different from false [2022-07-19 21:31:18,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset)) c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-19 21:31:18,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ c_~counter~0 (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) (- 1)) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|))) 0)) is different from false [2022-07-19 21:31:18,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~counter~0 (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) 0)) is different from false [2022-07-19 21:31:18,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) is different from false [2022-07-19 21:31:18,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:31:18,266 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 49 treesize of output 38 [2022-07-19 21:31:18,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 140 [2022-07-19 21:31:18,270 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 140 treesize of output 132 [2022-07-19 21:31:18,272 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 132 treesize of output 124 [2022-07-19 21:31:18,599 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 10 treesize of output 8 [2022-07-19 21:31:18,605 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-19 21:31:18,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600762956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:18,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:18,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 38 [2022-07-19 21:31:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305498901] [2022-07-19 21:31:18,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:18,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 21:31:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 21:31:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=829, Unknown=7, NotChecked=448, Total=1406 [2022-07-19 21:31:18,617 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 117 [2022-07-19 21:31:18,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 425 flow. Second operand has 38 states, 38 states have (on average 48.5) internal successors, (1843), 38 states have internal predecessors, (1843), 0 states have call successors, (0), 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-19 21:31:18,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:18,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 117 [2022-07-19 21:31:18,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:19,590 INFO L129 PetriNetUnfolder]: 471/1065 cut-off events. [2022-07-19 21:31:19,590 INFO L130 PetriNetUnfolder]: For 1207/1207 co-relation queries the response was YES. [2022-07-19 21:31:19,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1065 events. 471/1065 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6186 event pairs, 49 based on Foata normal form. 1/1055 useless extension candidates. Maximal degree in co-relation 2931. Up to 352 conditions per place. [2022-07-19 21:31:19,597 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 104 selfloop transitions, 49 changer transitions 4/196 dead transitions. [2022-07-19 21:31:19,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 196 transitions, 1052 flow [2022-07-19 21:31:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 21:31:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-19 21:31:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1313 transitions. [2022-07-19 21:31:19,600 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.43162393162393164 [2022-07-19 21:31:19,600 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1313 transitions. [2022-07-19 21:31:19,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1313 transitions. [2022-07-19 21:31:19,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:19,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1313 transitions. [2022-07-19 21:31:19,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 50.5) internal successors, (1313), 26 states have internal predecessors, (1313), 0 states have call successors, (0), 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-19 21:31:19,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 0 states have call successors, (0), 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-19 21:31:19,607 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 0 states have call successors, (0), 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-19 21:31:19,607 INFO L186 Difference]: Start difference. First operand has 138 places, 118 transitions, 425 flow. Second operand 26 states and 1313 transitions. [2022-07-19 21:31:19,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 196 transitions, 1052 flow [2022-07-19 21:31:19,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 196 transitions, 976 flow, removed 20 selfloop flow, removed 14 redundant places. [2022-07-19 21:31:19,612 INFO L242 Difference]: Finished difference. Result has 151 places, 138 transitions, 619 flow [2022-07-19 21:31:19,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=619, PETRI_PLACES=151, PETRI_TRANSITIONS=138} [2022-07-19 21:31:19,612 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 47 predicate places. [2022-07-19 21:31:19,613 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 138 transitions, 619 flow [2022-07-19 21:31:19,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 48.5) internal successors, (1843), 38 states have internal predecessors, (1843), 0 states have call successors, (0), 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-19 21:31:19,613 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:19,614 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] [2022-07-19 21:31:19,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:19,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:19,830 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1246130652, now seen corresponding path program 3 times [2022-07-19 21:31:19,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:19,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956630758] [2022-07-19 21:31:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:19,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:20,142 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-19 21:31:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:20,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956630758] [2022-07-19 21:31:20,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956630758] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523499399] [2022-07-19 21:31:20,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:31:20,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:20,144 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-19 21:31:20,145 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-19 21:31:20,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 21:31:20,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:20,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 21:31:20,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:20,463 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-19 21:31:20,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:20,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:31:20,504 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 24 treesize of output 25 [2022-07-19 21:31:20,600 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-19 21:31:20,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523499399] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:20,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:20,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 8] total 26 [2022-07-19 21:31:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971256407] [2022-07-19 21:31:20,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:20,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 21:31:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 21:31:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-07-19 21:31:20,602 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-19 21:31:20,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 138 transitions, 619 flow. Second operand has 26 states, 26 states have (on average 52.38461538461539) internal successors, (1362), 26 states have internal predecessors, (1362), 0 states have call successors, (0), 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-19 21:31:20,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:20,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-19 21:31:20,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:21,217 INFO L129 PetriNetUnfolder]: 586/1308 cut-off events. [2022-07-19 21:31:21,217 INFO L130 PetriNetUnfolder]: For 1953/1953 co-relation queries the response was YES. [2022-07-19 21:31:21,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 1308 events. 586/1308 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8300 event pairs, 146 based on Foata normal form. 1/1294 useless extension candidates. Maximal degree in co-relation 3787. Up to 784 conditions per place. [2022-07-19 21:31:21,225 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 112 selfloop transitions, 31 changer transitions 4/189 dead transitions. [2022-07-19 21:31:21,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 189 transitions, 1122 flow [2022-07-19 21:31:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 21:31:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-07-19 21:31:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1173 transitions. [2022-07-19 21:31:21,227 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4557109557109557 [2022-07-19 21:31:21,227 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1173 transitions. [2022-07-19 21:31:21,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1173 transitions. [2022-07-19 21:31:21,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:21,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1173 transitions. [2022-07-19 21:31:21,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 53.31818181818182) internal successors, (1173), 22 states have internal predecessors, (1173), 0 states have call successors, (0), 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-19 21:31:21,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 0 states have call successors, (0), 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-19 21:31:21,233 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 0 states have call successors, (0), 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-19 21:31:21,233 INFO L186 Difference]: Start difference. First operand has 151 places, 138 transitions, 619 flow. Second operand 22 states and 1173 transitions. [2022-07-19 21:31:21,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 189 transitions, 1122 flow [2022-07-19 21:31:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 189 transitions, 1028 flow, removed 32 selfloop flow, removed 14 redundant places. [2022-07-19 21:31:21,239 INFO L242 Difference]: Finished difference. Result has 161 places, 148 transitions, 693 flow [2022-07-19 21:31:21,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=693, PETRI_PLACES=161, PETRI_TRANSITIONS=148} [2022-07-19 21:31:21,240 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 57 predicate places. [2022-07-19 21:31:21,240 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 148 transitions, 693 flow [2022-07-19 21:31:21,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 52.38461538461539) internal successors, (1362), 26 states have internal predecessors, (1362), 0 states have call successors, (0), 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-19 21:31:21,240 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:21,240 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] [2022-07-19 21:31:21,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 21:31:21,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:21,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1270727132, now seen corresponding path program 4 times [2022-07-19 21:31:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:21,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174812872] [2022-07-19 21:31:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:21,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:21,613 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-19 21:31:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:21,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174812872] [2022-07-19 21:31:21,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174812872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:21,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413065713] [2022-07-19 21:31:21,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 21:31:21,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:21,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:21,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:21,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 21:31:21,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 21:31:21,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:21,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 21:31:21,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 21:31:22,031 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-19 21:31:22,072 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-19 21:31:22,156 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-19 21:31:22,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:22,278 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-19 21:31:22,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413065713] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:22,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:22,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 8] total 27 [2022-07-19 21:31:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995801777] [2022-07-19 21:31:22,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:22,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 21:31:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 21:31:22,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-07-19 21:31:22,281 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-19 21:31:22,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 148 transitions, 693 flow. Second operand has 27 states, 27 states have (on average 52.22222222222222) internal successors, (1410), 27 states have internal predecessors, (1410), 0 states have call successors, (0), 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-19 21:31:22,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:22,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-19 21:31:22,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:22,993 INFO L129 PetriNetUnfolder]: 701/1574 cut-off events. [2022-07-19 21:31:22,993 INFO L130 PetriNetUnfolder]: For 2197/2197 co-relation queries the response was YES. [2022-07-19 21:31:23,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1574 events. 701/1574 cut-off events. For 2197/2197 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10496 event pairs, 231 based on Foata normal form. 1/1556 useless extension candidates. Maximal degree in co-relation 4489. Up to 806 conditions per place. [2022-07-19 21:31:23,006 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 115 selfloop transitions, 45 changer transitions 4/206 dead transitions. [2022-07-19 21:31:23,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 206 transitions, 1261 flow [2022-07-19 21:31:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 21:31:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-19 21:31:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1275 transitions. [2022-07-19 21:31:23,010 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45405982905982906 [2022-07-19 21:31:23,010 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1275 transitions. [2022-07-19 21:31:23,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1275 transitions. [2022-07-19 21:31:23,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:23,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1275 transitions. [2022-07-19 21:31:23,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 53.125) internal successors, (1275), 24 states have internal predecessors, (1275), 0 states have call successors, (0), 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-19 21:31:23,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 117.0) internal successors, (2925), 25 states have internal predecessors, (2925), 0 states have call successors, (0), 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-19 21:31:23,018 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 117.0) internal successors, (2925), 25 states have internal predecessors, (2925), 0 states have call successors, (0), 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-19 21:31:23,019 INFO L186 Difference]: Start difference. First operand has 161 places, 148 transitions, 693 flow. Second operand 24 states and 1275 transitions. [2022-07-19 21:31:23,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 206 transitions, 1261 flow [2022-07-19 21:31:23,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 206 transitions, 1195 flow, removed 11 selfloop flow, removed 16 redundant places. [2022-07-19 21:31:23,026 INFO L242 Difference]: Finished difference. Result has 169 places, 161 transitions, 840 flow [2022-07-19 21:31:23,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=840, PETRI_PLACES=169, PETRI_TRANSITIONS=161} [2022-07-19 21:31:23,027 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 65 predicate places. [2022-07-19 21:31:23,028 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 161 transitions, 840 flow [2022-07-19 21:31:23,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 52.22222222222222) internal successors, (1410), 27 states have internal predecessors, (1410), 0 states have call successors, (0), 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-19 21:31:23,028 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:23,028 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] [2022-07-19 21:31:23,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:23,231 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1059485982, now seen corresponding path program 5 times [2022-07-19 21:31:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:23,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288461005] [2022-07-19 21:31:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:23,407 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-19 21:31:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288461005] [2022-07-19 21:31:23,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288461005] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320922734] [2022-07-19 21:31:23,407 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 21:31:23,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:23,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:23,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:23,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 21:31:23,474 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:23,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:23,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 21:31:23,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:23,676 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-19 21:31:23,810 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-19 21:31:23,855 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-19 21:31:23,956 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-19 21:31:23,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:24,107 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-19 21:31:24,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320922734] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:24,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:24,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 8] total 28 [2022-07-19 21:31:24,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198572131] [2022-07-19 21:31:24,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:24,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 21:31:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 21:31:24,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2022-07-19 21:31:24,110 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-19 21:31:24,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 161 transitions, 840 flow. Second operand has 28 states, 28 states have (on average 52.107142857142854) internal successors, (1459), 28 states have internal predecessors, (1459), 0 states have call successors, (0), 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-19 21:31:24,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:24,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-19 21:31:24,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:24,998 INFO L129 PetriNetUnfolder]: 831/1856 cut-off events. [2022-07-19 21:31:24,998 INFO L130 PetriNetUnfolder]: For 3366/3366 co-relation queries the response was YES. [2022-07-19 21:31:25,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5581 conditions, 1856 events. 831/1856 cut-off events. For 3366/3366 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12821 event pairs, 244 based on Foata normal form. 1/1842 useless extension candidates. Maximal degree in co-relation 5556. Up to 832 conditions per place. [2022-07-19 21:31:25,013 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 120 selfloop transitions, 61 changer transitions 4/227 dead transitions. [2022-07-19 21:31:25,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 227 transitions, 1523 flow [2022-07-19 21:31:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 21:31:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-19 21:31:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1380 transitions. [2022-07-19 21:31:25,015 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4536489151873767 [2022-07-19 21:31:25,015 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1380 transitions. [2022-07-19 21:31:25,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1380 transitions. [2022-07-19 21:31:25,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:25,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1380 transitions. [2022-07-19 21:31:25,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 53.07692307692308) internal successors, (1380), 26 states have internal predecessors, (1380), 0 states have call successors, (0), 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-19 21:31:25,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 0 states have call successors, (0), 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-19 21:31:25,022 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 0 states have call successors, (0), 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-19 21:31:25,022 INFO L186 Difference]: Start difference. First operand has 169 places, 161 transitions, 840 flow. Second operand 26 states and 1380 transitions. [2022-07-19 21:31:25,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 227 transitions, 1523 flow [2022-07-19 21:31:25,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 227 transitions, 1396 flow, removed 45 selfloop flow, removed 16 redundant places. [2022-07-19 21:31:25,030 INFO L242 Difference]: Finished difference. Result has 179 places, 177 transitions, 1020 flow [2022-07-19 21:31:25,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1020, PETRI_PLACES=179, PETRI_TRANSITIONS=177} [2022-07-19 21:31:25,031 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 75 predicate places. [2022-07-19 21:31:25,031 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 177 transitions, 1020 flow [2022-07-19 21:31:25,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 52.107142857142854) internal successors, (1459), 28 states have internal predecessors, (1459), 0 states have call successors, (0), 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-19 21:31:25,032 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:25,032 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:25,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:25,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:25,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:25,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash -836879962, now seen corresponding path program 6 times [2022-07-19 21:31:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:25,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899260935] [2022-07-19 21:31:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:25,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899260935] [2022-07-19 21:31:25,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899260935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:25,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346792478] [2022-07-19 21:31:25,341 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 21:31:25,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:25,342 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:25,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 21:31:25,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-19 21:31:25,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:25,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 21:31:25,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:25,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:25,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346792478] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:25,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:25,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-19 21:31:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278984298] [2022-07-19 21:31:25,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:25,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 21:31:25,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:25,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 21:31:25,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:31:25,718 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 117 [2022-07-19 21:31:25,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 177 transitions, 1020 flow. Second operand has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 0 states have call successors, (0), 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-19 21:31:25,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:25,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 117 [2022-07-19 21:31:25,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:26,172 INFO L129 PetriNetUnfolder]: 416/1418 cut-off events. [2022-07-19 21:31:26,172 INFO L130 PetriNetUnfolder]: For 2331/2349 co-relation queries the response was YES. [2022-07-19 21:31:26,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 1418 events. 416/1418 cut-off events. For 2331/2349 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10225 event pairs, 113 based on Foata normal form. 41/1442 useless extension candidates. Maximal degree in co-relation 4097. Up to 383 conditions per place. [2022-07-19 21:31:26,181 INFO L132 encePairwiseOnDemand]: 101/117 looper letters, 174 selfloop transitions, 33 changer transitions 0/292 dead transitions. [2022-07-19 21:31:26,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 292 transitions, 2234 flow [2022-07-19 21:31:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:31:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:31:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1370 transitions. [2022-07-19 21:31:26,183 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7318376068376068 [2022-07-19 21:31:26,183 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1370 transitions. [2022-07-19 21:31:26,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1370 transitions. [2022-07-19 21:31:26,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:26,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1370 transitions. [2022-07-19 21:31:26,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.625) internal successors, (1370), 16 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:26,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 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-19 21:31:26,187 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 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-19 21:31:26,188 INFO L186 Difference]: Start difference. First operand has 179 places, 177 transitions, 1020 flow. Second operand 16 states and 1370 transitions. [2022-07-19 21:31:26,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 292 transitions, 2234 flow [2022-07-19 21:31:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 292 transitions, 2048 flow, removed 55 selfloop flow, removed 19 redundant places. [2022-07-19 21:31:26,196 INFO L242 Difference]: Finished difference. Result has 182 places, 203 transitions, 1270 flow [2022-07-19 21:31:26,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1270, PETRI_PLACES=182, PETRI_TRANSITIONS=203} [2022-07-19 21:31:26,197 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 78 predicate places. [2022-07-19 21:31:26,197 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 203 transitions, 1270 flow [2022-07-19 21:31:26,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 0 states have call successors, (0), 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-19 21:31:26,198 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:26,198 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:26,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:26,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 21:31:26,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 447763680, now seen corresponding path program 7 times [2022-07-19 21:31:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:26,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744631761] [2022-07-19 21:31:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:26,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744631761] [2022-07-19 21:31:26,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744631761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417971574] [2022-07-19 21:31:26,528 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 21:31:26,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:26,538 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:26,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 21:31:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:26,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 21:31:26,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:26,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:26,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417971574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:26,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:26,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-19 21:31:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214326005] [2022-07-19 21:31:26,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:26,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 21:31:26,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 21:31:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:31:26,890 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 117 [2022-07-19 21:31:26,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 203 transitions, 1270 flow. Second operand has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 0 states have call successors, (0), 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-19 21:31:26,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:26,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 117 [2022-07-19 21:31:26,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:27,324 INFO L129 PetriNetUnfolder]: 351/1201 cut-off events. [2022-07-19 21:31:27,325 INFO L130 PetriNetUnfolder]: For 2100/2138 co-relation queries the response was YES. [2022-07-19 21:31:27,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 1201 events. 351/1201 cut-off events. For 2100/2138 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8505 event pairs, 135 based on Foata normal form. 62/1250 useless extension candidates. Maximal degree in co-relation 3650. Up to 453 conditions per place. [2022-07-19 21:31:27,334 INFO L132 encePairwiseOnDemand]: 101/117 looper letters, 101 selfloop transitions, 12 changer transitions 80/277 dead transitions. [2022-07-19 21:31:27,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 277 transitions, 2102 flow [2022-07-19 21:31:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:31:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:31:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1370 transitions. [2022-07-19 21:31:27,337 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7318376068376068 [2022-07-19 21:31:27,337 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1370 transitions. [2022-07-19 21:31:27,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1370 transitions. [2022-07-19 21:31:27,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:27,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1370 transitions. [2022-07-19 21:31:27,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.625) internal successors, (1370), 16 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:27,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 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-19 21:31:27,342 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 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-19 21:31:27,343 INFO L186 Difference]: Start difference. First operand has 182 places, 203 transitions, 1270 flow. Second operand 16 states and 1370 transitions. [2022-07-19 21:31:27,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 277 transitions, 2102 flow [2022-07-19 21:31:27,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 277 transitions, 2083 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-19 21:31:27,355 INFO L242 Difference]: Finished difference. Result has 198 places, 181 transitions, 1054 flow [2022-07-19 21:31:27,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1054, PETRI_PLACES=198, PETRI_TRANSITIONS=181} [2022-07-19 21:31:27,356 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 94 predicate places. [2022-07-19 21:31:27,356 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 181 transitions, 1054 flow [2022-07-19 21:31:27,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 0 states have call successors, (0), 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-19 21:31:27,357 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:27,357 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:27,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-19 21:31:27,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 21:31:27,571 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1322365107, now seen corresponding path program 8 times [2022-07-19 21:31:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:27,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351355685] [2022-07-19 21:31:27,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:31:27,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:27,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351355685] [2022-07-19 21:31:27,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351355685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:27,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003704575] [2022-07-19 21:31:27,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:31:27,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:27,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:27,649 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:27,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 21:31:27,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:27,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:27,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:31:27,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:31:27,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:31:27,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003704575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:27,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:27,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-07-19 21:31:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432965160] [2022-07-19 21:31:27,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:27,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 21:31:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 21:31:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:31:27,915 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 117 [2022-07-19 21:31:27,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 181 transitions, 1054 flow. Second operand has 19 states, 19 states have (on average 80.78947368421052) internal successors, (1535), 19 states have internal predecessors, (1535), 0 states have call successors, (0), 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-19 21:31:27,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:27,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 117 [2022-07-19 21:31:27,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:28,812 INFO L129 PetriNetUnfolder]: 427/1012 cut-off events. [2022-07-19 21:31:28,812 INFO L130 PetriNetUnfolder]: For 2446/2446 co-relation queries the response was YES. [2022-07-19 21:31:28,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 1012 events. 427/1012 cut-off events. For 2446/2446 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5229 event pairs, 10 based on Foata normal form. 49/1059 useless extension candidates. Maximal degree in co-relation 3806. Up to 165 conditions per place. [2022-07-19 21:31:28,822 INFO L132 encePairwiseOnDemand]: 99/117 looper letters, 173 selfloop transitions, 117 changer transitions 0/354 dead transitions. [2022-07-19 21:31:28,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 354 transitions, 2806 flow [2022-07-19 21:31:28,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-19 21:31:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-07-19 21:31:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3191 transitions. [2022-07-19 21:31:28,831 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6993206223975454 [2022-07-19 21:31:28,831 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3191 transitions. [2022-07-19 21:31:28,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3191 transitions. [2022-07-19 21:31:28,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:28,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3191 transitions. [2022-07-19 21:31:28,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 81.82051282051282) internal successors, (3191), 39 states have internal predecessors, (3191), 0 states have call successors, (0), 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-19 21:31:28,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 117.0) internal successors, (4680), 40 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:28,844 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 117.0) internal successors, (4680), 40 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:28,844 INFO L186 Difference]: Start difference. First operand has 198 places, 181 transitions, 1054 flow. Second operand 39 states and 3191 transitions. [2022-07-19 21:31:28,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 354 transitions, 2806 flow [2022-07-19 21:31:28,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 354 transitions, 2479 flow, removed 127 selfloop flow, removed 22 redundant places. [2022-07-19 21:31:28,859 INFO L242 Difference]: Finished difference. Result has 225 places, 251 transitions, 1785 flow [2022-07-19 21:31:28,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1785, PETRI_PLACES=225, PETRI_TRANSITIONS=251} [2022-07-19 21:31:28,860 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 121 predicate places. [2022-07-19 21:31:28,860 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 251 transitions, 1785 flow [2022-07-19 21:31:28,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 80.78947368421052) internal successors, (1535), 19 states have internal predecessors, (1535), 0 states have call successors, (0), 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-19 21:31:28,861 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:28,861 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:28,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:29,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 21:31:29,078 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash -823728965, now seen corresponding path program 9 times [2022-07-19 21:31:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:29,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289120451] [2022-07-19 21:31:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:31:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:29,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289120451] [2022-07-19 21:31:29,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289120451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:29,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50147107] [2022-07-19 21:31:29,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:31:29,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:29,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:29,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:29,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 21:31:29,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 21:31:29,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 21:31:29,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:31:29,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:31:29,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50147107] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:29,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:29,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-19 21:31:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871164844] [2022-07-19 21:31:29,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:29,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 21:31:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:29,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 21:31:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:31:29,566 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 117 [2022-07-19 21:31:29,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 251 transitions, 1785 flow. Second operand has 24 states, 24 states have (on average 83.95833333333333) internal successors, (2015), 24 states have internal predecessors, (2015), 0 states have call successors, (0), 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-19 21:31:29,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:29,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 117 [2022-07-19 21:31:29,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:29,869 INFO L129 PetriNetUnfolder]: 310/826 cut-off events. [2022-07-19 21:31:29,869 INFO L130 PetriNetUnfolder]: For 4356/4380 co-relation queries the response was YES. [2022-07-19 21:31:29,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3723 conditions, 826 events. 310/826 cut-off events. For 4356/4380 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3903 event pairs, 39 based on Foata normal form. 35/850 useless extension candidates. Maximal degree in co-relation 3679. Up to 171 conditions per place. [2022-07-19 21:31:29,876 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 137 selfloop transitions, 57 changer transitions 0/312 dead transitions. [2022-07-19 21:31:29,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 312 transitions, 2625 flow [2022-07-19 21:31:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:31:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-19 21:31:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1280 transitions. [2022-07-19 21:31:29,878 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7293447293447294 [2022-07-19 21:31:29,878 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1280 transitions. [2022-07-19 21:31:29,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1280 transitions. [2022-07-19 21:31:29,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:29,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1280 transitions. [2022-07-19 21:31:29,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 85.33333333333333) internal successors, (1280), 15 states have internal predecessors, (1280), 0 states have call successors, (0), 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-19 21:31:29,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 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-19 21:31:29,882 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 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-19 21:31:29,882 INFO L186 Difference]: Start difference. First operand has 225 places, 251 transitions, 1785 flow. Second operand 15 states and 1280 transitions. [2022-07-19 21:31:29,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 312 transitions, 2625 flow [2022-07-19 21:31:29,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 312 transitions, 2590 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-07-19 21:31:29,898 INFO L242 Difference]: Finished difference. Result has 232 places, 259 transitions, 1984 flow [2022-07-19 21:31:29,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1984, PETRI_PLACES=232, PETRI_TRANSITIONS=259} [2022-07-19 21:31:29,898 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 128 predicate places. [2022-07-19 21:31:29,898 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 259 transitions, 1984 flow [2022-07-19 21:31:29,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 83.95833333333333) internal successors, (2015), 24 states have internal predecessors, (2015), 0 states have call successors, (0), 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-19 21:31:29,899 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:29,899 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:29,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:30,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 21:31:30,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash -459984071, now seen corresponding path program 10 times [2022-07-19 21:31:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:30,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995847082] [2022-07-19 21:31:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:30,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995847082] [2022-07-19 21:31:30,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995847082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:30,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077337411] [2022-07-19 21:31:30,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 21:31:30,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:30,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:30,867 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:30,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 21:31:30,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 21:31:30,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:30,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-19 21:31:30,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:31,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:31:31,486 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 18 treesize of output 20 [2022-07-19 21:31:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:31:31,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:31,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_359) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) (* (select .cse0 (+ c_~A~0.offset 4)) (- 1)) c_~counter~0)) 0)) is different from false [2022-07-19 21:31:31,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_359) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (* (select .cse0 (+ c_~A~0.offset 4)) (- 1)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) c_~counter~0)) 0)) is different from false [2022-07-19 21:31:32,029 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:31:32,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-19 21:31:32,048 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-19 21:31:32,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-19 21:31:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-07-19 21:31:32,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077337411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:32,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:32,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23, 21] total 61 [2022-07-19 21:31:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123204047] [2022-07-19 21:31:32,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:32,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-19 21:31:32,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:32,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-19 21:31:32,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3220, Unknown=2, NotChecked=230, Total=3660 [2022-07-19 21:31:32,492 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-19 21:31:32,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 259 transitions, 1984 flow. Second operand has 61 states, 61 states have (on average 43.90163934426229) internal successors, (2678), 61 states have internal predecessors, (2678), 0 states have call successors, (0), 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-19 21:31:32,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:32,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-19 21:31:32,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:36,256 INFO L129 PetriNetUnfolder]: 1948/3543 cut-off events. [2022-07-19 21:31:36,257 INFO L130 PetriNetUnfolder]: For 17319/17319 co-relation queries the response was YES. [2022-07-19 21:31:36,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16097 conditions, 3543 events. 1948/3543 cut-off events. For 17319/17319 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22845 event pairs, 145 based on Foata normal form. 1/3533 useless extension candidates. Maximal degree in co-relation 16054. Up to 2096 conditions per place. [2022-07-19 21:31:36,287 INFO L132 encePairwiseOnDemand]: 83/117 looper letters, 394 selfloop transitions, 144 changer transitions 4/577 dead transitions. [2022-07-19 21:31:36,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 577 transitions, 5247 flow [2022-07-19 21:31:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-19 21:31:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-19 21:31:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 2573 transitions. [2022-07-19 21:31:36,296 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.39984459984459986 [2022-07-19 21:31:36,296 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 2573 transitions. [2022-07-19 21:31:36,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 2573 transitions. [2022-07-19 21:31:36,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:36,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 2573 transitions. [2022-07-19 21:31:36,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 46.78181818181818) internal successors, (2573), 55 states have internal predecessors, (2573), 0 states have call successors, (0), 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-19 21:31:36,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 0 states have call successors, (0), 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-19 21:31:36,314 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 0 states have call successors, (0), 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-19 21:31:36,314 INFO L186 Difference]: Start difference. First operand has 232 places, 259 transitions, 1984 flow. Second operand 55 states and 2573 transitions. [2022-07-19 21:31:36,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 577 transitions, 5247 flow [2022-07-19 21:31:36,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 577 transitions, 5107 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-07-19 21:31:36,364 INFO L242 Difference]: Finished difference. Result has 290 places, 371 transitions, 3266 flow [2022-07-19 21:31:36,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3266, PETRI_PLACES=290, PETRI_TRANSITIONS=371} [2022-07-19 21:31:36,365 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 186 predicate places. [2022-07-19 21:31:36,365 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 371 transitions, 3266 flow [2022-07-19 21:31:36,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 43.90163934426229) internal successors, (2678), 61 states have internal predecessors, (2678), 0 states have call successors, (0), 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-19 21:31:36,366 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:36,366 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:36,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:36,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 21:31:36,579 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1705508623, now seen corresponding path program 11 times [2022-07-19 21:31:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:36,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965020490] [2022-07-19 21:31:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965020490] [2022-07-19 21:31:37,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965020490] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864700442] [2022-07-19 21:31:37,136 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 21:31:37,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:37,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:37,138 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:37,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 21:31:37,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-19 21:31:37,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:37,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 21:31:37,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:31:37,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:37,997 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:31:37,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-19 21:31:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:31:38,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864700442] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:38,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:38,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 14] total 49 [2022-07-19 21:31:38,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914511252] [2022-07-19 21:31:38,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:38,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-19 21:31:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-19 21:31:38,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2181, Unknown=0, NotChecked=0, Total=2352 [2022-07-19 21:31:38,112 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-19 21:31:38,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 371 transitions, 3266 flow. Second operand has 49 states, 49 states have (on average 51.326530612244895) internal successors, (2515), 49 states have internal predecessors, (2515), 0 states have call successors, (0), 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-19 21:31:38,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:38,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-19 21:31:38,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:40,658 INFO L129 PetriNetUnfolder]: 2510/4582 cut-off events. [2022-07-19 21:31:40,658 INFO L130 PetriNetUnfolder]: For 26191/26194 co-relation queries the response was YES. [2022-07-19 21:31:40,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23108 conditions, 4582 events. 2510/4582 cut-off events. For 26191/26194 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 31395 event pairs, 439 based on Foata normal form. 1/4552 useless extension candidates. Maximal degree in co-relation 23052. Up to 3125 conditions per place. [2022-07-19 21:31:40,697 INFO L132 encePairwiseOnDemand]: 88/117 looper letters, 450 selfloop transitions, 146 changer transitions 4/638 dead transitions. [2022-07-19 21:31:40,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 638 transitions, 6626 flow [2022-07-19 21:31:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-19 21:31:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-19 21:31:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 2942 transitions. [2022-07-19 21:31:40,701 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45718725718725717 [2022-07-19 21:31:40,701 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 2942 transitions. [2022-07-19 21:31:40,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 2942 transitions. [2022-07-19 21:31:40,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:40,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 2942 transitions. [2022-07-19 21:31:40,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 53.49090909090909) internal successors, (2942), 55 states have internal predecessors, (2942), 0 states have call successors, (0), 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-19 21:31:40,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 0 states have call successors, (0), 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-19 21:31:40,710 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 0 states have call successors, (0), 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-19 21:31:40,710 INFO L186 Difference]: Start difference. First operand has 290 places, 371 transitions, 3266 flow. Second operand 55 states and 2942 transitions. [2022-07-19 21:31:40,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 638 transitions, 6626 flow [2022-07-19 21:31:40,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 638 transitions, 6462 flow, removed 68 selfloop flow, removed 14 redundant places. [2022-07-19 21:31:40,853 INFO L242 Difference]: Finished difference. Result has 352 places, 451 transitions, 4562 flow [2022-07-19 21:31:40,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=3160, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=4562, PETRI_PLACES=352, PETRI_TRANSITIONS=451} [2022-07-19 21:31:40,853 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 248 predicate places. [2022-07-19 21:31:40,854 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 451 transitions, 4562 flow [2022-07-19 21:31:40,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 51.326530612244895) internal successors, (2515), 49 states have internal predecessors, (2515), 0 states have call successors, (0), 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-19 21:31:40,854 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:40,854 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:40,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-19 21:31:41,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 21:31:41,071 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 922626737, now seen corresponding path program 12 times [2022-07-19 21:31:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:41,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13181584] [2022-07-19 21:31:41,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13181584] [2022-07-19 21:31:41,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13181584] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257042525] [2022-07-19 21:31:41,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 21:31:41,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:41,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:41,571 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:41,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 21:31:41,749 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-19 21:31:41,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:41,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-19 21:31:41,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:41,966 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 13 treesize of output 9 [2022-07-19 21:31:42,076 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-19 21:31:42,132 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-19 21:31:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:42,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:42,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_419) c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset .cse1 4)))) 0)) is different from false [2022-07-19 21:31:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:31:42,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257042525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:42,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:42,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 15] total 59 [2022-07-19 21:31:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143638241] [2022-07-19 21:31:42,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:42,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-19 21:31:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-19 21:31:42,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3108, Unknown=1, NotChecked=112, Total=3422 [2022-07-19 21:31:42,844 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-19 21:31:42,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 451 transitions, 4562 flow. Second operand has 59 states, 59 states have (on average 44.03389830508475) internal successors, (2598), 59 states have internal predecessors, (2598), 0 states have call successors, (0), 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-19 21:31:42,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:42,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-19 21:31:42,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:46,160 INFO L129 PetriNetUnfolder]: 2927/5346 cut-off events. [2022-07-19 21:31:46,161 INFO L130 PetriNetUnfolder]: For 35445/35466 co-relation queries the response was YES. [2022-07-19 21:31:46,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28389 conditions, 5346 events. 2927/5346 cut-off events. For 35445/35466 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 37839 event pairs, 518 based on Foata normal form. 15/5331 useless extension candidates. Maximal degree in co-relation 28310. Up to 3726 conditions per place. [2022-07-19 21:31:46,231 INFO L132 encePairwiseOnDemand]: 82/117 looper letters, 504 selfloop transitions, 208 changer transitions 4/751 dead transitions. [2022-07-19 21:31:46,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 751 transitions, 8468 flow [2022-07-19 21:31:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-19 21:31:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-07-19 21:31:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 3244 transitions. [2022-07-19 21:31:46,236 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3960927960927961 [2022-07-19 21:31:46,236 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 3244 transitions. [2022-07-19 21:31:46,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 3244 transitions. [2022-07-19 21:31:46,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:46,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 3244 transitions. [2022-07-19 21:31:46,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 46.34285714285714) internal successors, (3244), 70 states have internal predecessors, (3244), 0 states have call successors, (0), 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-19 21:31:46,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 117.0) internal successors, (8307), 71 states have internal predecessors, (8307), 0 states have call successors, (0), 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-19 21:31:46,249 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 117.0) internal successors, (8307), 71 states have internal predecessors, (8307), 0 states have call successors, (0), 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-19 21:31:46,250 INFO L186 Difference]: Start difference. First operand has 352 places, 451 transitions, 4562 flow. Second operand 70 states and 3244 transitions. [2022-07-19 21:31:46,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 751 transitions, 8468 flow [2022-07-19 21:31:46,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 751 transitions, 8331 flow, removed 33 selfloop flow, removed 26 redundant places. [2022-07-19 21:31:46,481 INFO L242 Difference]: Finished difference. Result has 408 places, 541 transitions, 6001 flow [2022-07-19 21:31:46,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4433, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=6001, PETRI_PLACES=408, PETRI_TRANSITIONS=541} [2022-07-19 21:31:46,482 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 304 predicate places. [2022-07-19 21:31:46,482 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 541 transitions, 6001 flow [2022-07-19 21:31:46,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 44.03389830508475) internal successors, (2598), 59 states have internal predecessors, (2598), 0 states have call successors, (0), 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-19 21:31:46,483 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:46,483 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:46,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:46,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:46,703 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1149062991, now seen corresponding path program 13 times [2022-07-19 21:31:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:46,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012256076] [2022-07-19 21:31:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:47,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012256076] [2022-07-19 21:31:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012256076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661582458] [2022-07-19 21:31:47,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 21:31:47,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:47,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:47,192 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:47,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 21:31:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:47,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-19 21:31:47,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:31:47,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:48,013 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:31:48,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-19 21:31:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:31:48,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661582458] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:48,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:48,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 14] total 47 [2022-07-19 21:31:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216272216] [2022-07-19 21:31:48,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:48,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-19 21:31:48,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:48,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-19 21:31:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2003, Unknown=0, NotChecked=0, Total=2162 [2022-07-19 21:31:48,123 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-19 21:31:48,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 541 transitions, 6001 flow. Second operand has 47 states, 47 states have (on average 50.97872340425532) internal successors, (2396), 47 states have internal predecessors, (2396), 0 states have call successors, (0), 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-19 21:31:48,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:48,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-19 21:31:48,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:51,729 INFO L129 PetriNetUnfolder]: 3440/6268 cut-off events. [2022-07-19 21:31:51,730 INFO L130 PetriNetUnfolder]: For 59767/59834 co-relation queries the response was YES. [2022-07-19 21:31:51,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38625 conditions, 6268 events. 3440/6268 cut-off events. For 59767/59834 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 45820 event pairs, 595 based on Foata normal form. 21/6258 useless extension candidates. Maximal degree in co-relation 38532. Up to 4025 conditions per place. [2022-07-19 21:31:51,910 INFO L132 encePairwiseOnDemand]: 88/117 looper letters, 539 selfloop transitions, 253 changer transitions 4/834 dead transitions. [2022-07-19 21:31:51,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 834 transitions, 10660 flow [2022-07-19 21:31:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-19 21:31:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-07-19 21:31:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 3377 transitions. [2022-07-19 21:31:51,915 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4581467914801248 [2022-07-19 21:31:51,915 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 3377 transitions. [2022-07-19 21:31:51,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 3377 transitions. [2022-07-19 21:31:51,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:51,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 3377 transitions. [2022-07-19 21:31:51,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 53.6031746031746) internal successors, (3377), 63 states have internal predecessors, (3377), 0 states have call successors, (0), 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-19 21:31:51,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 117.0) internal successors, (7488), 64 states have internal predecessors, (7488), 0 states have call successors, (0), 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-19 21:31:51,928 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 117.0) internal successors, (7488), 64 states have internal predecessors, (7488), 0 states have call successors, (0), 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-19 21:31:51,928 INFO L186 Difference]: Start difference. First operand has 408 places, 541 transitions, 6001 flow. Second operand 63 states and 3377 transitions. [2022-07-19 21:31:51,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 834 transitions, 10660 flow [2022-07-19 21:31:52,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 834 transitions, 10179 flow, removed 149 selfloop flow, removed 42 redundant places. [2022-07-19 21:31:52,359 INFO L242 Difference]: Finished difference. Result has 438 places, 616 transitions, 7211 flow [2022-07-19 21:31:52,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=5570, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=7211, PETRI_PLACES=438, PETRI_TRANSITIONS=616} [2022-07-19 21:31:52,360 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 334 predicate places. [2022-07-19 21:31:52,360 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 616 transitions, 7211 flow [2022-07-19 21:31:52,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 50.97872340425532) internal successors, (2396), 47 states have internal predecessors, (2396), 0 states have call successors, (0), 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-19 21:31:52,361 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:52,361 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:52,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:52,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:52,580 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1238531119, now seen corresponding path program 14 times [2022-07-19 21:31:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:52,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840101878] [2022-07-19 21:31:52,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:52,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:53,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:53,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840101878] [2022-07-19 21:31:53,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840101878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:53,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752449752] [2022-07-19 21:31:53,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:31:53,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:53,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:53,157 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:53,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 21:31:53,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:53,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:53,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-19 21:31:53,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:31:53,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:53,947 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:31:53,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-19 21:31:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:31:54,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752449752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:54,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:54,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 14] total 48 [2022-07-19 21:31:54,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312628271] [2022-07-19 21:31:54,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:54,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-19 21:31:54,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:54,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-19 21:31:54,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2091, Unknown=0, NotChecked=0, Total=2256 [2022-07-19 21:31:54,153 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-19 21:31:54,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 616 transitions, 7211 flow. Second operand has 48 states, 48 states have (on average 51.1875) internal successors, (2457), 48 states have internal predecessors, (2457), 0 states have call successors, (0), 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-19 21:31:54,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:54,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-19 21:31:54,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:57,447 INFO L129 PetriNetUnfolder]: 3680/6721 cut-off events. [2022-07-19 21:31:57,447 INFO L130 PetriNetUnfolder]: For 74160/74223 co-relation queries the response was YES. [2022-07-19 21:31:57,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42934 conditions, 6721 events. 3680/6721 cut-off events. For 74160/74223 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 49923 event pairs, 751 based on Foata normal form. 20/6701 useless extension candidates. Maximal degree in co-relation 42830. Up to 4753 conditions per place. [2022-07-19 21:31:57,543 INFO L132 encePairwiseOnDemand]: 88/117 looper letters, 563 selfloop transitions, 231 changer transitions 4/836 dead transitions. [2022-07-19 21:31:57,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 836 transitions, 11231 flow [2022-07-19 21:31:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-19 21:31:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-07-19 21:31:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 2986 transitions. [2022-07-19 21:31:57,574 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45573870573870573 [2022-07-19 21:31:57,574 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 2986 transitions. [2022-07-19 21:31:57,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 2986 transitions. [2022-07-19 21:31:57,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:57,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 2986 transitions. [2022-07-19 21:31:57,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 53.32142857142857) internal successors, (2986), 56 states have internal predecessors, (2986), 0 states have call successors, (0), 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-19 21:31:57,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 117.0) internal successors, (6669), 57 states have internal predecessors, (6669), 0 states have call successors, (0), 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-19 21:31:57,585 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 117.0) internal successors, (6669), 57 states have internal predecessors, (6669), 0 states have call successors, (0), 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-19 21:31:57,585 INFO L186 Difference]: Start difference. First operand has 438 places, 616 transitions, 7211 flow. Second operand 56 states and 2986 transitions. [2022-07-19 21:31:57,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 836 transitions, 11231 flow [2022-07-19 21:31:58,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 836 transitions, 10805 flow, removed 136 selfloop flow, removed 30 redundant places. [2022-07-19 21:31:58,023 INFO L242 Difference]: Finished difference. Result has 470 places, 652 transitions, 8111 flow [2022-07-19 21:31:58,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=6841, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=8111, PETRI_PLACES=470, PETRI_TRANSITIONS=652} [2022-07-19 21:31:58,024 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 366 predicate places. [2022-07-19 21:31:58,024 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 652 transitions, 8111 flow [2022-07-19 21:31:58,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 51.1875) internal successors, (2457), 48 states have internal predecessors, (2457), 0 states have call successors, (0), 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-19 21:31:58,024 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:58,025 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:58,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-19 21:31:58,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:58,230 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:31:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:58,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1132419989, now seen corresponding path program 15 times [2022-07-19 21:31:58,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:58,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151534730] [2022-07-19 21:31:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:58,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:59,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:59,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151534730] [2022-07-19 21:31:59,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151534730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:59,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3100354] [2022-07-19 21:31:59,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:31:59,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:59,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:59,046 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:59,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 21:31:59,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 21:31:59,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:59,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-19 21:31:59,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:00,268 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:32:00,311 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 15 treesize of output 16 [2022-07-19 21:32:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:00,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:01,006 INFO L356 Elim1Store]: treesize reduction 29, result has 67.0 percent of original size [2022-07-19 21:32:01,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 71 [2022-07-19 21:32:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:01,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3100354] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:01,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:01,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 25] total 77 [2022-07-19 21:32:01,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680103631] [2022-07-19 21:32:01,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:01,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-07-19 21:32:01,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-07-19 21:32:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=5413, Unknown=0, NotChecked=0, Total=5852 [2022-07-19 21:32:01,878 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-19 21:32:01,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 652 transitions, 8111 flow. Second operand has 77 states, 77 states have (on average 43.64935064935065) internal successors, (3361), 77 states have internal predecessors, (3361), 0 states have call successors, (0), 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-19 21:32:01,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:01,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-19 21:32:01,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:07,923 INFO L129 PetriNetUnfolder]: 4566/8409 cut-off events. [2022-07-19 21:32:07,923 INFO L130 PetriNetUnfolder]: For 100705/100769 co-relation queries the response was YES. [2022-07-19 21:32:07,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54347 conditions, 8409 events. 4566/8409 cut-off events. For 100705/100769 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 65920 event pairs, 778 based on Foata normal form. 18/8384 useless extension candidates. Maximal degree in co-relation 54237. Up to 5146 conditions per place. [2022-07-19 21:32:08,025 INFO L132 encePairwiseOnDemand]: 81/117 looper letters, 685 selfloop transitions, 384 changer transitions 10/1114 dead transitions. [2022-07-19 21:32:08,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 1114 transitions, 15769 flow [2022-07-19 21:32:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-07-19 21:32:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-07-19 21:32:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 3453 transitions. [2022-07-19 21:32:08,029 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3935042735042735 [2022-07-19 21:32:08,029 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 3453 transitions. [2022-07-19 21:32:08,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 3453 transitions. [2022-07-19 21:32:08,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:08,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 3453 transitions. [2022-07-19 21:32:08,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 46.04) internal successors, (3453), 75 states have internal predecessors, (3453), 0 states have call successors, (0), 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-19 21:32:08,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 117.0) internal successors, (8892), 76 states have internal predecessors, (8892), 0 states have call successors, (0), 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-19 21:32:08,038 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 117.0) internal successors, (8892), 76 states have internal predecessors, (8892), 0 states have call successors, (0), 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-19 21:32:08,038 INFO L186 Difference]: Start difference. First operand has 470 places, 652 transitions, 8111 flow. Second operand 75 states and 3453 transitions. [2022-07-19 21:32:08,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 1114 transitions, 15769 flow [2022-07-19 21:32:08,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 1114 transitions, 14809 flow, removed 331 selfloop flow, removed 43 redundant places. [2022-07-19 21:32:08,623 INFO L242 Difference]: Finished difference. Result has 529 places, 854 transitions, 11722 flow [2022-07-19 21:32:08,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=7489, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=11722, PETRI_PLACES=529, PETRI_TRANSITIONS=854} [2022-07-19 21:32:08,624 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 425 predicate places. [2022-07-19 21:32:08,625 INFO L495 AbstractCegarLoop]: Abstraction has has 529 places, 854 transitions, 11722 flow [2022-07-19 21:32:08,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 43.64935064935065) internal successors, (3361), 77 states have internal predecessors, (3361), 0 states have call successors, (0), 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-19 21:32:08,625 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:08,626 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:32:08,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-19 21:32:08,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:08,832 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:32:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1005576847, now seen corresponding path program 16 times [2022-07-19 21:32:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:08,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272823734] [2022-07-19 21:32:08,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:09,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272823734] [2022-07-19 21:32:09,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272823734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:09,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831178852] [2022-07-19 21:32:09,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 21:32:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:09,756 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:32:09,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-19 21:32:09,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 21:32:09,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:09,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 21:32:09,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:32:10,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:10,534 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:32:10,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-19 21:32:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:32:10,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831178852] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:10,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:10,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21, 14] total 51 [2022-07-19 21:32:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810998242] [2022-07-19 21:32:10,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:10,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 21:32:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:10,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 21:32:10,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2365, Unknown=0, NotChecked=0, Total=2550 [2022-07-19 21:32:10,636 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-19 21:32:10,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 854 transitions, 11722 flow. Second operand has 51 states, 51 states have (on average 44.11764705882353) internal successors, (2250), 51 states have internal predecessors, (2250), 0 states have call successors, (0), 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-19 21:32:10,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:10,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-19 21:32:10,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:15,049 INFO L129 PetriNetUnfolder]: 4760/8727 cut-off events. [2022-07-19 21:32:15,049 INFO L130 PetriNetUnfolder]: For 132788/132875 co-relation queries the response was YES. [2022-07-19 21:32:15,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64077 conditions, 8727 events. 4760/8727 cut-off events. For 132788/132875 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 68126 event pairs, 1066 based on Foata normal form. 20/8702 useless extension candidates. Maximal degree in co-relation 63940. Up to 6344 conditions per place. [2022-07-19 21:32:15,174 INFO L132 encePairwiseOnDemand]: 86/117 looper letters, 744 selfloop transitions, 228 changer transitions 4/1011 dead transitions. [2022-07-19 21:32:15,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1011 transitions, 15660 flow [2022-07-19 21:32:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-19 21:32:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-07-19 21:32:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 2450 transitions. [2022-07-19 21:32:15,177 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.39509756490888565 [2022-07-19 21:32:15,177 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 2450 transitions. [2022-07-19 21:32:15,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 2450 transitions. [2022-07-19 21:32:15,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:15,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 2450 transitions. [2022-07-19 21:32:15,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 46.22641509433962) internal successors, (2450), 53 states have internal predecessors, (2450), 0 states have call successors, (0), 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-19 21:32:15,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 117.0) internal successors, (6318), 54 states have internal predecessors, (6318), 0 states have call successors, (0), 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-19 21:32:15,183 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 117.0) internal successors, (6318), 54 states have internal predecessors, (6318), 0 states have call successors, (0), 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-19 21:32:15,183 INFO L186 Difference]: Start difference. First operand has 529 places, 854 transitions, 11722 flow. Second operand 53 states and 2450 transitions. [2022-07-19 21:32:15,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 1011 transitions, 15660 flow [2022-07-19 21:32:15,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 1011 transitions, 14939 flow, removed 292 selfloop flow, removed 38 redundant places. [2022-07-19 21:32:15,987 INFO L242 Difference]: Finished difference. Result has 542 places, 861 transitions, 11631 flow [2022-07-19 21:32:15,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=11011, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=11631, PETRI_PLACES=542, PETRI_TRANSITIONS=861} [2022-07-19 21:32:15,988 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 438 predicate places. [2022-07-19 21:32:15,988 INFO L495 AbstractCegarLoop]: Abstraction has has 542 places, 861 transitions, 11631 flow [2022-07-19 21:32:15,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 44.11764705882353) internal successors, (2250), 51 states have internal predecessors, (2250), 0 states have call successors, (0), 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-19 21:32:15,988 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:15,989 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:32:16,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-19 21:32:16,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:16,208 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:32:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 191143539, now seen corresponding path program 17 times [2022-07-19 21:32:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:16,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949214555] [2022-07-19 21:32:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:16,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:16,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949214555] [2022-07-19 21:32:16,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949214555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:16,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845693295] [2022-07-19 21:32:16,790 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 21:32:16,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:16,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:16,804 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:32:16,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-19 21:32:16,893 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-19 21:32:16,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:16,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-19 21:32:16,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:17,233 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 13 treesize of output 9 [2022-07-19 21:32:17,388 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-19 21:32:17,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:32:17,601 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 18 treesize of output 20 [2022-07-19 21:32:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:17,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:17,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:32:17,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:32:17,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)))) 0)) is different from false [2022-07-19 21:32:17,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base)) (.cse0 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (* (- 1) (select .cse1 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse1 (+ c_~A~0.offset 4))) (select .cse1 (+ c_~A~0.offset .cse0 4)))) 0)) is different from false [2022-07-19 21:32:18,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base) c_~A~0.offset)) c_~counter~0) 0)) is different from false [2022-07-19 21:32:18,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base) c_~A~0.offset)) c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-19 21:32:18,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ c_~counter~0 (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|))) 0)) is different from false [2022-07-19 21:32:18,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) 0)) is different from false [2022-07-19 21:32:18,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~counter~0)) 0)) is different from false [2022-07-19 21:32:18,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:32:18,056 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 49 treesize of output 38 [2022-07-19 21:32:18,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 290 [2022-07-19 21:32:18,063 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 290 treesize of output 274 [2022-07-19 21:32:18,065 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 274 treesize of output 258 [2022-07-19 21:32:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 13 not checked. [2022-07-19 21:32:18,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845693295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:18,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:18,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 23] total 64 [2022-07-19 21:32:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856256212] [2022-07-19 21:32:18,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:18,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-19 21:32:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-19 21:32:18,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2796, Unknown=9, NotChecked=1026, Total=4032 [2022-07-19 21:32:18,231 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 117 [2022-07-19 21:32:18,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 861 transitions, 11631 flow. Second operand has 64 states, 64 states have (on average 40.890625) internal successors, (2617), 64 states have internal predecessors, (2617), 0 states have call successors, (0), 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-19 21:32:18,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:18,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 117 [2022-07-19 21:32:18,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:25,442 INFO L129 PetriNetUnfolder]: 6320/11529 cut-off events. [2022-07-19 21:32:25,442 INFO L130 PetriNetUnfolder]: For 174299/174390 co-relation queries the response was YES. [2022-07-19 21:32:25,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86340 conditions, 11529 events. 6320/11529 cut-off events. For 174299/174390 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 93851 event pairs, 1166 based on Foata normal form. 20/11510 useless extension candidates. Maximal degree in co-relation 86205. Up to 7834 conditions per place. [2022-07-19 21:32:25,714 INFO L132 encePairwiseOnDemand]: 83/117 looper letters, 1014 selfloop transitions, 423 changer transitions 4/1473 dead transitions. [2022-07-19 21:32:25,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 1473 transitions, 24158 flow [2022-07-19 21:32:25,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-19 21:32:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-07-19 21:32:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 2669 transitions. [2022-07-19 21:32:25,718 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.37396665265517726 [2022-07-19 21:32:25,718 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 2669 transitions. [2022-07-19 21:32:25,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 2669 transitions. [2022-07-19 21:32:25,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:25,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 2669 transitions. [2022-07-19 21:32:25,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 43.75409836065574) internal successors, (2669), 61 states have internal predecessors, (2669), 0 states have call successors, (0), 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-19 21:32:25,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 117.0) internal successors, (7254), 62 states have internal predecessors, (7254), 0 states have call successors, (0), 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-19 21:32:25,750 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 117.0) internal successors, (7254), 62 states have internal predecessors, (7254), 0 states have call successors, (0), 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-19 21:32:25,750 INFO L186 Difference]: Start difference. First operand has 542 places, 861 transitions, 11631 flow. Second operand 61 states and 2669 transitions. [2022-07-19 21:32:25,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 1473 transitions, 24158 flow [2022-07-19 21:32:26,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 1473 transitions, 23559 flow, removed 38 selfloop flow, removed 49 redundant places. [2022-07-19 21:32:26,907 INFO L242 Difference]: Finished difference. Result has 579 places, 1215 transitions, 18982 flow [2022-07-19 21:32:26,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=11259, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=18982, PETRI_PLACES=579, PETRI_TRANSITIONS=1215} [2022-07-19 21:32:26,908 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 475 predicate places. [2022-07-19 21:32:26,909 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 1215 transitions, 18982 flow [2022-07-19 21:32:26,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 40.890625) internal successors, (2617), 64 states have internal predecessors, (2617), 0 states have call successors, (0), 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-19 21:32:26,909 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:26,909 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:32:26,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-19 21:32:27,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:27,133 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:32:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -771135465, now seen corresponding path program 18 times [2022-07-19 21:32:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:27,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058182680] [2022-07-19 21:32:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058182680] [2022-07-19 21:32:27,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058182680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153448697] [2022-07-19 21:32:27,861 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 21:32:27,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:27,863 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:32:27,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-19 21:32:27,951 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-19 21:32:27,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:27,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-19 21:32:27,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:28,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:32:28,480 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 18 treesize of output 20 [2022-07-19 21:32:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:32:28,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:28,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_592) c_~A~0.base))) (+ (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)))) 0)) is different from false [2022-07-19 21:32:28,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_592) c_~A~0.base))) (+ (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)))) 0)) is different from false [2022-07-19 21:32:28,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_592) c_~A~0.base))) (+ (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)))) 0)) is different from false [2022-07-19 21:32:28,849 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:32:28,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-19 21:32:28,860 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-19 21:32:28,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-19 21:32:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-07-19 21:32:29,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153448697] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:29,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:29,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21, 21] total 57 [2022-07-19 21:32:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126450920] [2022-07-19 21:32:29,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:29,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-19 21:32:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:29,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-19 21:32:29,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2691, Unknown=3, NotChecked=318, Total=3192 [2022-07-19 21:32:29,140 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 117 [2022-07-19 21:32:29,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 1215 transitions, 18982 flow. Second operand has 57 states, 57 states have (on average 42.05263157894737) internal successors, (2397), 57 states have internal predecessors, (2397), 0 states have call successors, (0), 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-19 21:32:29,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:29,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 117 [2022-07-19 21:32:29,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:36,568 INFO L129 PetriNetUnfolder]: 7049/12919 cut-off events. [2022-07-19 21:32:36,568 INFO L130 PetriNetUnfolder]: For 339589/339738 co-relation queries the response was YES. [2022-07-19 21:32:36,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115209 conditions, 12919 events. 7049/12919 cut-off events. For 339589/339738 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 108110 event pairs, 1607 based on Foata normal form. 41/12890 useless extension candidates. Maximal degree in co-relation 115049. Up to 9093 conditions per place. [2022-07-19 21:32:36,971 INFO L132 encePairwiseOnDemand]: 85/117 looper letters, 958 selfloop transitions, 485 changer transitions 4/1479 dead transitions. [2022-07-19 21:32:36,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 1479 transitions, 26102 flow [2022-07-19 21:32:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-19 21:32:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-07-19 21:32:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2237 transitions. [2022-07-19 21:32:36,974 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3823931623931624 [2022-07-19 21:32:36,974 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 2237 transitions. [2022-07-19 21:32:36,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 2237 transitions. [2022-07-19 21:32:36,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:36,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2237 transitions. [2022-07-19 21:32:36,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 44.74) internal successors, (2237), 50 states have internal predecessors, (2237), 0 states have call successors, (0), 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-19 21:32:36,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 117.0) internal successors, (5967), 51 states have internal predecessors, (5967), 0 states have call successors, (0), 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-19 21:32:36,981 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 117.0) internal successors, (5967), 51 states have internal predecessors, (5967), 0 states have call successors, (0), 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-19 21:32:36,982 INFO L186 Difference]: Start difference. First operand has 579 places, 1215 transitions, 18982 flow. Second operand 50 states and 2237 transitions. [2022-07-19 21:32:36,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 1479 transitions, 26102 flow [2022-07-19 21:32:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 1479 transitions, 25450 flow, removed 207 selfloop flow, removed 28 redundant places. [2022-07-19 21:32:39,072 INFO L242 Difference]: Finished difference. Result has 611 places, 1317 transitions, 21841 flow [2022-07-19 21:32:39,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=18424, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=21841, PETRI_PLACES=611, PETRI_TRANSITIONS=1317} [2022-07-19 21:32:39,073 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 507 predicate places. [2022-07-19 21:32:39,074 INFO L495 AbstractCegarLoop]: Abstraction has has 611 places, 1317 transitions, 21841 flow [2022-07-19 21:32:39,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 42.05263157894737) internal successors, (2397), 57 states have internal predecessors, (2397), 0 states have call successors, (0), 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-19 21:32:39,074 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:39,074 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:32:39,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-19 21:32:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-19 21:32:39,287 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:32:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2086619099, now seen corresponding path program 19 times [2022-07-19 21:32:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:39,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761182093] [2022-07-19 21:32:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:39,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761182093] [2022-07-19 21:32:39,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761182093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:39,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287944585] [2022-07-19 21:32:39,982 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 21:32:39,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:39,983 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:32:39,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-19 21:32:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:40,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-19 21:32:40,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:40,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-19 21:32:40,159 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:32:40,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 21:32:40,489 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 18 treesize of output 20 [2022-07-19 21:32:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:32:40,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:40,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_622) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0)) is different from false [2022-07-19 21:32:40,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_622) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:32:40,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_622) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:32:40,941 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:32:40,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-19 21:32:40,958 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-19 21:32:40,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-19 21:32:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-07-19 21:32:41,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287944585] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:41,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:41,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 21] total 57 [2022-07-19 21:32:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391834340] [2022-07-19 21:32:41,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:41,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-19 21:32:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:41,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-19 21:32:41,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2669, Unknown=3, NotChecked=318, Total=3192 [2022-07-19 21:32:41,214 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 117 [2022-07-19 21:32:41,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 1317 transitions, 21841 flow. Second operand has 57 states, 57 states have (on average 41.91228070175438) internal successors, (2389), 57 states have internal predecessors, (2389), 0 states have call successors, (0), 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-19 21:32:41,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:41,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 117 [2022-07-19 21:32:41,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:49,779 INFO L129 PetriNetUnfolder]: 8591/15839 cut-off events. [2022-07-19 21:32:49,779 INFO L130 PetriNetUnfolder]: For 467646/467791 co-relation queries the response was YES. [2022-07-19 21:32:49,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148210 conditions, 15839 events. 8591/15839 cut-off events. For 467646/467791 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 136120 event pairs, 1836 based on Foata normal form. 49/15817 useless extension candidates. Maximal degree in co-relation 148038. Up to 10046 conditions per place. [2022-07-19 21:32:50,088 INFO L132 encePairwiseOnDemand]: 84/117 looper letters, 1242 selfloop transitions, 820 changer transitions 8/2102 dead transitions. [2022-07-19 21:32:50,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 2102 transitions, 40509 flow [2022-07-19 21:32:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-19 21:32:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-07-19 21:32:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 3469 transitions. [2022-07-19 21:32:50,092 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.38012272627657245 [2022-07-19 21:32:50,092 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 3469 transitions. [2022-07-19 21:32:50,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 3469 transitions. [2022-07-19 21:32:50,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:50,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 3469 transitions. [2022-07-19 21:32:50,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 44.47435897435897) internal successors, (3469), 78 states have internal predecessors, (3469), 0 states have call successors, (0), 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-19 21:32:50,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 117.0) internal successors, (9243), 79 states have internal predecessors, (9243), 0 states have call successors, (0), 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-19 21:32:50,100 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 117.0) internal successors, (9243), 79 states have internal predecessors, (9243), 0 states have call successors, (0), 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-19 21:32:50,100 INFO L186 Difference]: Start difference. First operand has 611 places, 1317 transitions, 21841 flow. Second operand 78 states and 3469 transitions. [2022-07-19 21:32:50,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 2102 transitions, 40509 flow [2022-07-19 21:32:53,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 2102 transitions, 39748 flow, removed 268 selfloop flow, removed 33 redundant places. [2022-07-19 21:32:53,099 INFO L242 Difference]: Finished difference. Result has 691 places, 1803 transitions, 34108 flow [2022-07-19 21:32:53,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=21092, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=34108, PETRI_PLACES=691, PETRI_TRANSITIONS=1803} [2022-07-19 21:32:53,100 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 587 predicate places. [2022-07-19 21:32:53,100 INFO L495 AbstractCegarLoop]: Abstraction has has 691 places, 1803 transitions, 34108 flow [2022-07-19 21:32:53,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 41.91228070175438) internal successors, (2389), 57 states have internal predecessors, (2389), 0 states have call successors, (0), 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-19 21:32:53,101 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:53,101 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:32:53,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-19 21:32:53,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-19 21:32:53,307 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:32:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1982964057, now seen corresponding path program 20 times [2022-07-19 21:32:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:53,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418078574] [2022-07-19 21:32:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:32:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:54,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418078574] [2022-07-19 21:32:54,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418078574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:54,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484356317] [2022-07-19 21:32:54,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:32:54,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:54,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:54,028 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:32:54,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-19 21:32:54,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:32:54,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:54,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-19 21:32:54,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:54,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:32:54,567 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 18 treesize of output 20 [2022-07-19 21:32:54,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:32:54,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:32:54,694 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 31 treesize of output 14 [2022-07-19 21:32:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:32:54,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:54,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:32:54,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) c_~A~0.base))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:32:54,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) c_~A~0.base))) (+ c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:32:54,896 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:32:54,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-19 21:32:54,929 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-19 21:32:54,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-19 21:32:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-07-19 21:32:55,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484356317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:55,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:55,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21, 21] total 57 [2022-07-19 21:32:55,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427154420] [2022-07-19 21:32:55,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:55,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-19 21:32:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-19 21:32:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2688, Unknown=3, NotChecked=318, Total=3192 [2022-07-19 21:32:55,320 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 117 [2022-07-19 21:32:55,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 1803 transitions, 34108 flow. Second operand has 57 states, 57 states have (on average 42.01754385964912) internal successors, (2395), 57 states have internal predecessors, (2395), 0 states have call successors, (0), 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-19 21:32:55,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:55,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 117 [2022-07-19 21:32:55,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:33:08,707 INFO L129 PetriNetUnfolder]: 9890/18288 cut-off events. [2022-07-19 21:33:08,707 INFO L130 PetriNetUnfolder]: For 1442790/1443011 co-relation queries the response was YES. [2022-07-19 21:33:09,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219193 conditions, 18288 events. 9890/18288 cut-off events. For 1442790/1443011 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 161420 event pairs, 2111 based on Foata normal form. 124/18332 useless extension candidates. Maximal degree in co-relation 218984. Up to 10746 conditions per place. [2022-07-19 21:33:09,242 INFO L132 encePairwiseOnDemand]: 84/117 looper letters, 1205 selfloop transitions, 1261 changer transitions 4/2502 dead transitions. [2022-07-19 21:33:09,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 2502 transitions, 54277 flow [2022-07-19 21:33:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-07-19 21:33:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-07-19 21:33:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 3152 transitions. [2022-07-19 21:33:09,245 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.37943902732635126 [2022-07-19 21:33:09,245 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 3152 transitions. [2022-07-19 21:33:09,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 3152 transitions. [2022-07-19 21:33:09,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:33:09,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 3152 transitions. [2022-07-19 21:33:09,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 44.394366197183096) internal successors, (3152), 71 states have internal predecessors, (3152), 0 states have call successors, (0), 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-19 21:33:09,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 117.0) internal successors, (8424), 72 states have internal predecessors, (8424), 0 states have call successors, (0), 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-19 21:33:09,253 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 117.0) internal successors, (8424), 72 states have internal predecessors, (8424), 0 states have call successors, (0), 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-19 21:33:09,253 INFO L186 Difference]: Start difference. First operand has 691 places, 1803 transitions, 34108 flow. Second operand 71 states and 3152 transitions. [2022-07-19 21:33:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 2502 transitions, 54277 flow [2022-07-19 21:33:15,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 2502 transitions, 52715 flow, removed 645 selfloop flow, removed 38 redundant places. [2022-07-19 21:33:15,958 INFO L242 Difference]: Finished difference. Result has 738 places, 2196 transitions, 45047 flow [2022-07-19 21:33:15,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=32754, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=915, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=45047, PETRI_PLACES=738, PETRI_TRANSITIONS=2196} [2022-07-19 21:33:15,961 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 634 predicate places. [2022-07-19 21:33:15,961 INFO L495 AbstractCegarLoop]: Abstraction has has 738 places, 2196 transitions, 45047 flow [2022-07-19 21:33:15,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 42.01754385964912) internal successors, (2395), 57 states have internal predecessors, (2395), 0 states have call successors, (0), 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-19 21:33:15,962 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:33:15,962 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:33:15,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-19 21:33:16,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-19 21:33:16,178 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:33:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:33:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 722800081, now seen corresponding path program 21 times [2022-07-19 21:33:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:33:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357843720] [2022-07-19 21:33:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:33:16,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:33:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:33:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:33:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:33:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357843720] [2022-07-19 21:33:16,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357843720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:33:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637129476] [2022-07-19 21:33:16,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:33:16,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:33:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:33:16,903 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:33:16,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-19 21:33:17,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 21:33:17,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:33:17,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-19 21:33:17,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:33:17,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-19 21:33:17,259 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:33:17,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 21:33:17,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 21:33:17,772 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-19 21:33:18,024 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 18 treesize of output 20 [2022-07-19 21:33:18,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:33:18,259 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 19 treesize of output 20 [2022-07-19 21:33:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:33:18,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:33:18,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) is different from false [2022-07-19 21:33:18,897 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) is different from false [2022-07-19 21:33:18,955 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4))))) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) (not (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0))) is different from false [2022-07-19 21:33:18,965 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0)) 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) (not (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0))) is different from false [2022-07-19 21:33:18,975 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select .cse1 (+ c_~A~0.offset .cse0 4)) (* (- 1) (select .cse1 c_~A~0.offset)) (* (- 1) (select .cse1 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0)) 0)))) is different from false [2022-07-19 21:33:19,002 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse0 (+ c_~A~0.offset 4)))) 0) (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) (not (< 1 c_~N~0))) is different from false [2022-07-19 21:33:19,063 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse1 (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (* (- 1) (select .cse1 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse1 (+ c_~A~0.offset 4)) (* (- 1) (select .cse1 c_~A~0.offset))))) 0))) (not (< 1 c_~N~0))) is different from false [2022-07-19 21:33:19,095 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_#t~ret8#1.base|))) (+ (* (- 1) (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.offset|)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret8#1.offset| 4)) (select (select .cse1 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) c_~counter~0 (* (- 1) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret8#1.offset| (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|))))))) 0))) (not (< 1 c_~N~0))) is different from false [2022-07-19 21:33:19,112 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) (* (- 1) (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) 0))) (not (< 1 c_~N~0))) is different from false [2022-07-19 21:33:19,126 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (* (- 1) (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~counter~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|) (* (- 1) (select .cse0 (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) 0) (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0))))) is different from false [2022-07-19 21:33:19,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:33:19,452 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 103 treesize of output 68 [2022-07-19 21:33:19,464 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-07-19 21:33:19,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 278 treesize of output 244 [2022-07-19 21:33:19,476 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-07-19 21:33:19,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 196 [2022-07-19 21:33:19,488 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-07-19 21:33:19,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 168 [2022-07-19 21:33:20,286 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 10 treesize of output 8 [2022-07-19 21:33:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-19 21:33:20,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637129476] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:33:20,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:33:20,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 91 [2022-07-19 21:33:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451940569] [2022-07-19 21:33:20,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:33:20,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-19 21:33:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:33:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-19 21:33:20,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=6058, Unknown=11, NotChecked=1670, Total=8190 [2022-07-19 21:33:20,297 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 117 [2022-07-19 21:33:20,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 738 places, 2196 transitions, 45047 flow. Second operand has 91 states, 91 states have (on average 40.2967032967033) internal successors, (3667), 91 states have internal predecessors, (3667), 0 states have call successors, (0), 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-19 21:33:20,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:33:20,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 117 [2022-07-19 21:33:20,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:33:39,876 INFO L129 PetriNetUnfolder]: 12287/22669 cut-off events. [2022-07-19 21:33:39,877 INFO L130 PetriNetUnfolder]: For 1818403/1818731 co-relation queries the response was YES. [2022-07-19 21:33:40,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273984 conditions, 22669 events. 12287/22669 cut-off events. For 1818403/1818731 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 206283 event pairs, 2285 based on Foata normal form. 103/22703 useless extension candidates. Maximal degree in co-relation 273759. Up to 11781 conditions per place. [2022-07-19 21:33:41,273 INFO L132 encePairwiseOnDemand]: 79/117 looper letters, 1437 selfloop transitions, 1671 changer transitions 4/3144 dead transitions. [2022-07-19 21:33:41,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 811 places, 3144 transitions, 70211 flow [2022-07-19 21:33:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-07-19 21:33:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-07-19 21:33:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 3349 transitions. [2022-07-19 21:33:41,277 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3766306792622582 [2022-07-19 21:33:41,278 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 3349 transitions. [2022-07-19 21:33:41,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 3349 transitions. [2022-07-19 21:33:41,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:33:41,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 3349 transitions. [2022-07-19 21:33:41,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 44.06578947368421) internal successors, (3349), 76 states have internal predecessors, (3349), 0 states have call successors, (0), 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-19 21:33:41,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 117.0) internal successors, (9009), 77 states have internal predecessors, (9009), 0 states have call successors, (0), 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-19 21:33:41,302 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 117.0) internal successors, (9009), 77 states have internal predecessors, (9009), 0 states have call successors, (0), 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-19 21:33:41,318 INFO L186 Difference]: Start difference. First operand has 738 places, 2196 transitions, 45047 flow. Second operand 76 states and 3349 transitions. [2022-07-19 21:33:41,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 811 places, 3144 transitions, 70211 flow [2022-07-19 21:33:51,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 774 places, 3144 transitions, 68937 flow, removed 408 selfloop flow, removed 37 redundant places. [2022-07-19 21:33:51,886 INFO L242 Difference]: Finished difference. Result has 795 places, 2751 transitions, 61611 flow [2022-07-19 21:33:51,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=43941, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=61611, PETRI_PLACES=795, PETRI_TRANSITIONS=2751} [2022-07-19 21:33:51,888 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 691 predicate places. [2022-07-19 21:33:51,888 INFO L495 AbstractCegarLoop]: Abstraction has has 795 places, 2751 transitions, 61611 flow [2022-07-19 21:33:51,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 40.2967032967033) internal successors, (3667), 91 states have internal predecessors, (3667), 0 states have call successors, (0), 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-19 21:33:51,888 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:33:51,889 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:33:51,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-19 21:33:52,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:33:52,099 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:33:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:33:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 223892959, now seen corresponding path program 22 times [2022-07-19 21:33:52,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:33:52,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568669416] [2022-07-19 21:33:52,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:33:52,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:33:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:33:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:33:52,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:33:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568669416] [2022-07-19 21:33:52,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568669416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:33:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509503046] [2022-07-19 21:33:52,864 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 21:33:52,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:33:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:33:52,865 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:33:52,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-19 21:33:52,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 21:33:52,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:33:52,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-19 21:33:52,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:33:52,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-19 21:33:53,042 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:33:53,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 21:33:53,439 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 18 treesize of output 20 [2022-07-19 21:33:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:33:53,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:33:53,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_714) c_~A~0.base))) (+ c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0)) is different from false [2022-07-19 21:33:53,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_714) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-19 21:33:53,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (Array Int Int))) (= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_714) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))))) is different from false [2022-07-19 21:33:53,915 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-19 21:33:53,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-19 21:33:53,929 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-19 21:33:53,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-19 21:33:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-07-19 21:33:54,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509503046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:33:54,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:33:54,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 23, 21] total 63 [2022-07-19 21:33:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747038267] [2022-07-19 21:33:54,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:33:54,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-19 21:33:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:33:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-19 21:33:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3312, Unknown=3, NotChecked=354, Total=3906 [2022-07-19 21:33:54,238 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 117 [2022-07-19 21:33:54,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 2751 transitions, 61611 flow. Second operand has 63 states, 63 states have (on average 40.857142857142854) internal successors, (2574), 63 states have internal predecessors, (2574), 0 states have call successors, (0), 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-19 21:33:54,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:33:54,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 117 [2022-07-19 21:33:54,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand