/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:31:54,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:31:54,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:31:54,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:31:54,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:31:54,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:31:54,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:31:54,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:31:54,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:31:54,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:31:54,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:31:54,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:31:54,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:31:54,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:31:54,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:31:54,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:31:54,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:31:54,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:31:54,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:31:54,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:31:54,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:31:54,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:31:54,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:31:54,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:31:54,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:31:54,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:31:54,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:31:54,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:31:54,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:31:54,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:31:54,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:31:54,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:31:54,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:31:54,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:31:54,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:31:54,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:31:54,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:31:54,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:31:54,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:31:54,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:31:54,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:31:54,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 19:31:54,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:31:54,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:31:54,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:31:54,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:31:54,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:31:54,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:31:54,498 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:31:54,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:31:54,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:31:54,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:31:54,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:31:54,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:31:54,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:31:54,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:31:54,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:31:54,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:31:54,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:31:54,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:31:54,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:31:54,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:31:54,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:31:54,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:31:54,501 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:31:54,501 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:31:54,501 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 [2022-12-05 19:31:54,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:31:54,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:31:54,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:31:54,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:31:54,753 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:31:54,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2022-12-05 19:31:55,860 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:31:56,044 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:31:56,044 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2022-12-05 19:31:56,050 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5318bd6d1/de93c631cd2e424b94c43168d5261e89/FLAG246b50630 [2022-12-05 19:31:56,067 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5318bd6d1/de93c631cd2e424b94c43168d5261e89 [2022-12-05 19:31:56,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:31:56,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:31:56,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:31:56,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:31:56,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:31:56,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c04939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56, skipping insertion in model container [2022-12-05 19:31:56,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:31:56,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:31:56,199 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2598,2611] [2022-12-05 19:31:56,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:31:56,217 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:31:56,246 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2598,2611] [2022-12-05 19:31:56,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:31:56,271 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:31:56,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56 WrapperNode [2022-12-05 19:31:56,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:31:56,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:31:56,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:31:56,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:31:56,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,331 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 193 [2022-12-05 19:31:56,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:31:56,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:31:56,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:31:56,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:31:56,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,370 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:31:56,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:31:56,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:31:56,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:31:56,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (1/1) ... [2022-12-05 19:31:56,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:31:56,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:31:56,413 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-12-05 19:31:56,432 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-12-05 19:31:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:31:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:31:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:31:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:31:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:31:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:31:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:31:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:31:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 19:31:56,446 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 19:31:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:31:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 19:31:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:31:56,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:31:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:31:56,448 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:31:56,541 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:31:56,542 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:31:56,788 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:31:56,795 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:31:56,796 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-05 19:31:56,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:31:56 BoogieIcfgContainer [2022-12-05 19:31:56,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:31:56,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:31:56,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:31:56,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:31:56,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:31:56" (1/3) ... [2022-12-05 19:31:56,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28332be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:31:56, skipping insertion in model container [2022-12-05 19:31:56,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:31:56" (2/3) ... [2022-12-05 19:31:56,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28332be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:31:56, skipping insertion in model container [2022-12-05 19:31:56,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:31:56" (3/3) ... [2022-12-05 19:31:56,803 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2022-12-05 19:31:56,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:31:56,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:31:56,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:31:56,905 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-05 19:31:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 265 transitions, 554 flow [2022-12-05 19:31:57,041 INFO L130 PetriNetUnfolder]: 25/262 cut-off events. [2022-12-05 19:31:57,041 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:31:57,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 262 events. 25/262 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 174 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-05 19:31:57,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 265 transitions, 554 flow [2022-12-05 19:31:57,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 252 transitions, 522 flow [2022-12-05 19:31:57,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:31:57,069 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3549216c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:31:57,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 19:31:57,101 INFO L130 PetriNetUnfolder]: 25/251 cut-off events. [2022-12-05 19:31:57,101 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:31:57,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:31:57,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:31:57,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:31:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:31:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash 482697875, now seen corresponding path program 1 times [2022-12-05 19:31:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:31:57,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747697271] [2022-12-05 19:31:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:31:57,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:31:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:31:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:31:57,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:31:57,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747697271] [2022-12-05 19:31:57,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747697271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:31:57,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:31:57,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 19:31:57,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331294235] [2022-12-05 19:31:57,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:31:57,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:31:57,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:31:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:31:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 19:31:57,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 265 [2022-12-05 19:31:57,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 252 transitions, 522 flow. Second operand has 8 states, 8 states have (on average 148.75) internal successors, (1190), 8 states have internal predecessors, (1190), 0 states have call successors, (0), 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-12-05 19:31:57,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:31:57,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 265 [2022-12-05 19:31:57,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:31:58,377 INFO L130 PetriNetUnfolder]: 81/784 cut-off events. [2022-12-05 19:31:58,378 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 19:31:58,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 784 events. 81/784 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3002 event pairs, 36 based on Foata normal form. 66/760 useless extension candidates. Maximal degree in co-relation 734. Up to 121 conditions per place. [2022-12-05 19:31:58,388 INFO L137 encePairwiseOnDemand]: 211/265 looper letters, 94 selfloop transitions, 18 changer transitions 132/371 dead transitions. [2022-12-05 19:31:58,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 371 transitions, 1284 flow [2022-12-05 19:31:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 19:31:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 19:31:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2514 transitions. [2022-12-05 19:31:58,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5929245283018868 [2022-12-05 19:31:58,406 INFO L175 Difference]: Start difference. First operand has 237 places, 252 transitions, 522 flow. Second operand 16 states and 2514 transitions. [2022-12-05 19:31:58,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 371 transitions, 1284 flow [2022-12-05 19:31:58,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 371 transitions, 1248 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 19:31:58,419 INFO L231 Difference]: Finished difference. Result has 253 places, 227 transitions, 538 flow [2022-12-05 19:31:58,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=538, PETRI_PLACES=253, PETRI_TRANSITIONS=227} [2022-12-05 19:31:58,426 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, 16 predicate places. [2022-12-05 19:31:58,426 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 227 transitions, 538 flow [2022-12-05 19:31:58,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 148.75) internal successors, (1190), 8 states have internal predecessors, (1190), 0 states have call successors, (0), 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-12-05 19:31:58,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:31:58,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:31:58,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:31:58,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:31:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:31:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash -376756615, now seen corresponding path program 1 times [2022-12-05 19:31:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:31:58,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665791654] [2022-12-05 19:31:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:31:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:31:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:31:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:31:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:31:58,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665791654] [2022-12-05 19:31:58,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665791654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:31:58,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720714553] [2022-12-05 19:31:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:31:58,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:31:58,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:31:58,671 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-12-05 19:31:58,723 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-12-05 19:31:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:31:58,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 19:31:58,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:31:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:31:59,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:31:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:31:59,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720714553] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:31:59,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:31:59,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-05 19:31:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791790011] [2022-12-05 19:31:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:31:59,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:31:59,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:31:59,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:31:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-05 19:31:59,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 265 [2022-12-05 19:31:59,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 227 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 0 states have call successors, (0), 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-12-05 19:31:59,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:31:59,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 265 [2022-12-05 19:31:59,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:31:59,445 INFO L130 PetriNetUnfolder]: 47/348 cut-off events. [2022-12-05 19:31:59,445 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-05 19:31:59,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 348 events. 47/348 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 696 event pairs, 12 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 554. Up to 93 conditions per place. [2022-12-05 19:31:59,447 INFO L137 encePairwiseOnDemand]: 257/265 looper letters, 71 selfloop transitions, 7 changer transitions 0/233 dead transitions. [2022-12-05 19:31:59,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 233 transitions, 708 flow [2022-12-05 19:31:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:31:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:31:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1321 transitions. [2022-12-05 19:31:59,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7121293800539084 [2022-12-05 19:31:59,451 INFO L175 Difference]: Start difference. First operand has 253 places, 227 transitions, 538 flow. Second operand 7 states and 1321 transitions. [2022-12-05 19:31:59,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 233 transitions, 708 flow [2022-12-05 19:31:59,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 233 transitions, 662 flow, removed 9 selfloop flow, removed 10 redundant places. [2022-12-05 19:31:59,459 INFO L231 Difference]: Finished difference. Result has 231 places, 229 transitions, 525 flow [2022-12-05 19:31:59,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=525, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2022-12-05 19:31:59,459 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, -6 predicate places. [2022-12-05 19:31:59,460 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 525 flow [2022-12-05 19:31:59,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 0 states have call successors, (0), 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-12-05 19:31:59,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:31:59,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:31:59,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 19:31:59,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:31:59,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:31:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:31:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash -799203320, now seen corresponding path program 1 times [2022-12-05 19:31:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:31:59,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087808323] [2022-12-05 19:31:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:31:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:31:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:31:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:31:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:31:59,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087808323] [2022-12-05 19:31:59,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087808323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:31:59,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071468992] [2022-12-05 19:31:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:31:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:31:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:31:59,944 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-12-05 19:31:59,991 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-12-05 19:32:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:00,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 19:32:00,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:00,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:32:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:00,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071468992] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:00,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:32:00,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-12-05 19:32:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913625575] [2022-12-05 19:32:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:32:00,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 19:32:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:32:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 19:32:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-05 19:32:00,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 265 [2022-12-05 19:32:00,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 525 flow. Second operand has 9 states, 9 states have (on average 175.33333333333334) internal successors, (1578), 9 states have internal predecessors, (1578), 0 states have call successors, (0), 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-12-05 19:32:00,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:32:00,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 265 [2022-12-05 19:32:00,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:32:00,862 INFO L130 PetriNetUnfolder]: 1156/2317 cut-off events. [2022-12-05 19:32:00,862 INFO L131 PetriNetUnfolder]: For 935/1337 co-relation queries the response was YES. [2022-12-05 19:32:00,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4830 conditions, 2317 events. 1156/2317 cut-off events. For 935/1337 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14252 event pairs, 223 based on Foata normal form. 402/2478 useless extension candidates. Maximal degree in co-relation 4752. Up to 498 conditions per place. [2022-12-05 19:32:00,877 INFO L137 encePairwiseOnDemand]: 254/265 looper letters, 133 selfloop transitions, 17 changer transitions 0/295 dead transitions. [2022-12-05 19:32:00,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 295 transitions, 1008 flow [2022-12-05 19:32:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 19:32:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 19:32:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1989 transitions. [2022-12-05 19:32:00,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6823327615780446 [2022-12-05 19:32:00,880 INFO L175 Difference]: Start difference. First operand has 231 places, 229 transitions, 525 flow. Second operand 11 states and 1989 transitions. [2022-12-05 19:32:00,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 295 transitions, 1008 flow [2022-12-05 19:32:00,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 295 transitions, 995 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 19:32:00,885 INFO L231 Difference]: Finished difference. Result has 241 places, 240 transitions, 605 flow [2022-12-05 19:32:00,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=605, PETRI_PLACES=241, PETRI_TRANSITIONS=240} [2022-12-05 19:32:00,886 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, 4 predicate places. [2022-12-05 19:32:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 240 transitions, 605 flow [2022-12-05 19:32:00,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 175.33333333333334) internal successors, (1578), 9 states have internal predecessors, (1578), 0 states have call successors, (0), 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-12-05 19:32:00,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:32:00,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:32:00,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-05 19:32:01,091 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,SelfDestructingSolverStorable2 [2022-12-05 19:32:01,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:32:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:32:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 673306796, now seen corresponding path program 2 times [2022-12-05 19:32:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:32:01,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143786348] [2022-12-05 19:32:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:32:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:32:01,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143786348] [2022-12-05 19:32:01,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143786348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:01,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465145314] [2022-12-05 19:32:01,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:32:01,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:01,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:32:01,327 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-12-05 19:32:01,366 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-12-05 19:32:01,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-05 19:32:01,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:32:01,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:32:01,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-05 19:32:01,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 19:32:01,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465145314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:32:01,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 19:32:01,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-12-05 19:32:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155232074] [2022-12-05 19:32:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:32:01,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:32:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:32:01,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:32:01,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-12-05 19:32:01,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 265 [2022-12-05 19:32:01,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 240 transitions, 605 flow. Second operand has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 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-12-05 19:32:01,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:32:01,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 265 [2022-12-05 19:32:01,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:32:02,148 INFO L130 PetriNetUnfolder]: 1961/3864 cut-off events. [2022-12-05 19:32:02,149 INFO L131 PetriNetUnfolder]: For 2537/3232 co-relation queries the response was YES. [2022-12-05 19:32:02,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8898 conditions, 3864 events. 1961/3864 cut-off events. For 2537/3232 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 26430 event pairs, 748 based on Foata normal form. 688/4431 useless extension candidates. Maximal degree in co-relation 8817. Up to 1675 conditions per place. [2022-12-05 19:32:02,173 INFO L137 encePairwiseOnDemand]: 254/265 looper letters, 141 selfloop transitions, 10 changer transitions 10/313 dead transitions. [2022-12-05 19:32:02,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 313 transitions, 1185 flow [2022-12-05 19:32:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:32:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:32:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1566 transitions. [2022-12-05 19:32:02,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6566037735849056 [2022-12-05 19:32:02,178 INFO L175 Difference]: Start difference. First operand has 241 places, 240 transitions, 605 flow. Second operand 9 states and 1566 transitions. [2022-12-05 19:32:02,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 313 transitions, 1185 flow [2022-12-05 19:32:02,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 313 transitions, 1178 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 19:32:02,189 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 679 flow [2022-12-05 19:32:02,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=679, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2022-12-05 19:32:02,191 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, 14 predicate places. [2022-12-05 19:32:02,191 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 679 flow [2022-12-05 19:32:02,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 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-12-05 19:32:02,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:32:02,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:32:02,206 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-12-05 19:32:02,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:02,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:32:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:32:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash -777805456, now seen corresponding path program 3 times [2022-12-05 19:32:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:32:02,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190687964] [2022-12-05 19:32:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:32:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:32:02,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190687964] [2022-12-05 19:32:02,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190687964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:02,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821165683] [2022-12-05 19:32:02,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:32:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:32:02,589 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-12-05 19:32:02,590 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-12-05 19:32:02,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-05 19:32:02,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:32:02,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 19:32:02,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-05 19:32:02,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 19:32:02,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821165683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:32:02,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 19:32:02,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-12-05 19:32:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369499355] [2022-12-05 19:32:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:32:02,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 19:32:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:32:02,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 19:32:02,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-05 19:32:02,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 265 [2022-12-05 19:32:02,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 679 flow. Second operand has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 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-12-05 19:32:02,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:32:02,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 265 [2022-12-05 19:32:02,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:32:03,575 INFO L130 PetriNetUnfolder]: 2381/4842 cut-off events. [2022-12-05 19:32:03,575 INFO L131 PetriNetUnfolder]: For 4330/5194 co-relation queries the response was YES. [2022-12-05 19:32:03,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11633 conditions, 4842 events. 2381/4842 cut-off events. For 4330/5194 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 35850 event pairs, 1036 based on Foata normal form. 857/5546 useless extension candidates. Maximal degree in co-relation 11547. Up to 1642 conditions per place. [2022-12-05 19:32:03,604 INFO L137 encePairwiseOnDemand]: 254/265 looper letters, 146 selfloop transitions, 17 changer transitions 10/325 dead transitions. [2022-12-05 19:32:03,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 325 transitions, 1313 flow [2022-12-05 19:32:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:32:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:32:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1583 transitions. [2022-12-05 19:32:03,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6637316561844864 [2022-12-05 19:32:03,607 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 679 flow. Second operand 9 states and 1583 transitions. [2022-12-05 19:32:03,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 325 transitions, 1313 flow [2022-12-05 19:32:03,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 325 transitions, 1278 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-05 19:32:03,624 INFO L231 Difference]: Finished difference. Result has 257 places, 254 transitions, 794 flow [2022-12-05 19:32:03,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=794, PETRI_PLACES=257, PETRI_TRANSITIONS=254} [2022-12-05 19:32:03,627 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, 20 predicate places. [2022-12-05 19:32:03,627 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 254 transitions, 794 flow [2022-12-05 19:32:03,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 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-12-05 19:32:03,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:32:03,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:32:03,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 19:32:03,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:03,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:32:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:32:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1881432804, now seen corresponding path program 4 times [2022-12-05 19:32:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:32:03,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868614811] [2022-12-05 19:32:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:32:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:32:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868614811] [2022-12-05 19:32:04,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868614811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425845666] [2022-12-05 19:32:04,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 19:32:04,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:04,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:32:04,125 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-12-05 19:32:04,127 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-12-05 19:32:04,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 19:32:04,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:32:04,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 19:32:04,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:04,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:32:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:04,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425845666] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:04,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:32:04,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-12-05 19:32:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732169784] [2022-12-05 19:32:04,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:32:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 19:32:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:32:04,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 19:32:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-05 19:32:04,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 265 [2022-12-05 19:32:04,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 254 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 175.33333333333334) internal successors, (1578), 9 states have internal predecessors, (1578), 0 states have call successors, (0), 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-12-05 19:32:04,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:32:04,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 265 [2022-12-05 19:32:04,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:32:05,434 INFO L130 PetriNetUnfolder]: 2771/5440 cut-off events. [2022-12-05 19:32:05,434 INFO L131 PetriNetUnfolder]: For 7005/7968 co-relation queries the response was YES. [2022-12-05 19:32:05,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14105 conditions, 5440 events. 2771/5440 cut-off events. For 7005/7968 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 40531 event pairs, 213 based on Foata normal form. 960/6199 useless extension candidates. Maximal degree in co-relation 14025. Up to 2420 conditions per place. [2022-12-05 19:32:05,462 INFO L137 encePairwiseOnDemand]: 252/265 looper letters, 133 selfloop transitions, 41 changer transitions 0/319 dead transitions. [2022-12-05 19:32:05,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 319 transitions, 1429 flow [2022-12-05 19:32:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:32:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:32:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1815 transitions. [2022-12-05 19:32:05,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6849056603773584 [2022-12-05 19:32:05,465 INFO L175 Difference]: Start difference. First operand has 257 places, 254 transitions, 794 flow. Second operand 10 states and 1815 transitions. [2022-12-05 19:32:05,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 319 transitions, 1429 flow [2022-12-05 19:32:05,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 319 transitions, 1397 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-05 19:32:05,507 INFO L231 Difference]: Finished difference. Result has 263 places, 274 transitions, 1074 flow [2022-12-05 19:32:05,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1074, PETRI_PLACES=263, PETRI_TRANSITIONS=274} [2022-12-05 19:32:05,508 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, 26 predicate places. [2022-12-05 19:32:05,508 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 274 transitions, 1074 flow [2022-12-05 19:32:05,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 175.33333333333334) internal successors, (1578), 9 states have internal predecessors, (1578), 0 states have call successors, (0), 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-12-05 19:32:05,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:32:05,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:32:05,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-05 19:32:05,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:05,714 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:32:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:32:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash -131295004, now seen corresponding path program 5 times [2022-12-05 19:32:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:32:05,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376442313] [2022-12-05 19:32:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:32:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:32:05,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376442313] [2022-12-05 19:32:05,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376442313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:05,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273385004] [2022-12-05 19:32:05,900 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 19:32:05,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:05,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:32:05,918 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-12-05 19:32:05,919 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-12-05 19:32:06,028 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:32:06,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:32:06,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 19:32:06,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:06,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:32:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:32:06,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273385004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:32:06,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:32:06,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-12-05 19:32:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323745833] [2022-12-05 19:32:06,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:32:06,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 19:32:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:32:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 19:32:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-12-05 19:32:06,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 265 [2022-12-05 19:32:06,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 274 transitions, 1074 flow. Second operand has 17 states, 17 states have (on average 169.88235294117646) internal successors, (2888), 17 states have internal predecessors, (2888), 0 states have call successors, (0), 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-12-05 19:32:06,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:32:06,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 265 [2022-12-05 19:32:06,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:32:09,582 INFO L130 PetriNetUnfolder]: 13055/24984 cut-off events. [2022-12-05 19:32:09,583 INFO L131 PetriNetUnfolder]: For 47158/47400 co-relation queries the response was YES. [2022-12-05 19:32:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70021 conditions, 24984 events. 13055/24984 cut-off events. For 47158/47400 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 221103 event pairs, 1226 based on Foata normal form. 69/24881 useless extension candidates. Maximal degree in co-relation 69925. Up to 2545 conditions per place. [2022-12-05 19:32:09,881 INFO L137 encePairwiseOnDemand]: 237/265 looper letters, 364 selfloop transitions, 146 changer transitions 0/649 dead transitions. [2022-12-05 19:32:09,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 649 transitions, 4073 flow [2022-12-05 19:32:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 19:32:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 19:32:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4464 transitions. [2022-12-05 19:32:09,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.673811320754717 [2022-12-05 19:32:09,890 INFO L175 Difference]: Start difference. First operand has 263 places, 274 transitions, 1074 flow. Second operand 25 states and 4464 transitions. [2022-12-05 19:32:09,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 649 transitions, 4073 flow [2022-12-05 19:32:10,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 649 transitions, 4046 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-05 19:32:10,173 INFO L231 Difference]: Finished difference. Result has 298 places, 376 transitions, 2542 flow [2022-12-05 19:32:10,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2542, PETRI_PLACES=298, PETRI_TRANSITIONS=376} [2022-12-05 19:32:10,174 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, 61 predicate places. [2022-12-05 19:32:10,174 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 376 transitions, 2542 flow [2022-12-05 19:32:10,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 169.88235294117646) internal successors, (2888), 17 states have internal predecessors, (2888), 0 states have call successors, (0), 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-12-05 19:32:10,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:32:10,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:32:10,184 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-12-05 19:32:10,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:10,382 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:32:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:32:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1663270232, now seen corresponding path program 6 times [2022-12-05 19:32:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:32:10,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200355044] [2022-12-05 19:32:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:10,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:32:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:32:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:32:10,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200355044] [2022-12-05 19:32:10,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200355044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:10,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410081504] [2022-12-05 19:32:10,562 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 19:32:10,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:10,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:32:10,564 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-12-05 19:32:10,568 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-12-05 19:32:10,681 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-05 19:32:10,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:32:10,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 19:32:10,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:32:10,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:32:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:32:11,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410081504] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:32:11,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:32:11,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-12-05 19:32:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692608935] [2022-12-05 19:32:11,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:32:11,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 19:32:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:32:11,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 19:32:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 19:32:11,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 265 [2022-12-05 19:32:11,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 376 transitions, 2542 flow. Second operand has 20 states, 20 states have (on average 173.3) internal successors, (3466), 20 states have internal predecessors, (3466), 0 states have call successors, (0), 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-12-05 19:32:11,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:32:11,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 265 [2022-12-05 19:32:11,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:32:13,614 INFO L130 PetriNetUnfolder]: 5959/12667 cut-off events. [2022-12-05 19:32:13,614 INFO L131 PetriNetUnfolder]: For 48907/49340 co-relation queries the response was YES. [2022-12-05 19:32:13,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41170 conditions, 12667 events. 5959/12667 cut-off events. For 48907/49340 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 111884 event pairs, 640 based on Foata normal form. 88/12604 useless extension candidates. Maximal degree in co-relation 41058. Up to 1701 conditions per place. [2022-12-05 19:32:13,831 INFO L137 encePairwiseOnDemand]: 240/265 looper letters, 250 selfloop transitions, 166 changer transitions 0/578 dead transitions. [2022-12-05 19:32:13,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 578 transitions, 4513 flow [2022-12-05 19:32:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 19:32:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 19:32:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3786 transitions. [2022-12-05 19:32:13,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6803234501347709 [2022-12-05 19:32:13,861 INFO L175 Difference]: Start difference. First operand has 298 places, 376 transitions, 2542 flow. Second operand 21 states and 3786 transitions. [2022-12-05 19:32:13,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 578 transitions, 4513 flow [2022-12-05 19:32:14,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 578 transitions, 4388 flow, removed 52 selfloop flow, removed 6 redundant places. [2022-12-05 19:32:14,120 INFO L231 Difference]: Finished difference. Result has 317 places, 424 transitions, 3466 flow [2022-12-05 19:32:14,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2469, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3466, PETRI_PLACES=317, PETRI_TRANSITIONS=424} [2022-12-05 19:32:14,121 INFO L294 CegarLoopForPetriNet]: 237 programPoint places, 80 predicate places. [2022-12-05 19:32:14,122 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 424 transitions, 3466 flow [2022-12-05 19:32:14,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 173.3) internal successors, (3466), 20 states have internal predecessors, (3466), 0 states have call successors, (0), 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-12-05 19:32:14,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:32:14,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 19:32:14,144 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-12-05 19:32:14,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:14,329 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:32:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:32:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash -593887435, now seen corresponding path program 1 times [2022-12-05 19:32:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:32:14,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608434249] [2022-12-05 19:32:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:32:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:32:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:32:19,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608434249] [2022-12-05 19:32:19,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608434249] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:32:19,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279114060] [2022-12-05 19:32:19,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:32:19,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:32:19,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:32:19,404 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-12-05 19:32:19,425 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-12-05 19:32:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:32:19,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 131 conjunts are in the unsatisfiable core [2022-12-05 19:32:19,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:32:20,139 INFO L350 Elim1Store]: Elim1 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-12-05 19:32:21,164 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-05 19:32:21,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-05 19:32:21,503 INFO L350 Elim1Store]: Elim1 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-12-05 19:32:22,101 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-05 19:32:22,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-05 19:32:22,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-05 19:32:23,314 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-05 19:32:23,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-12-05 19:32:23,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-05 19:32:24,492 INFO L350 Elim1Store]: Elim1 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-12-05 19:32:24,947 INFO L350 Elim1Store]: Elim1 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-12-05 19:32:25,225 INFO L350 Elim1Store]: Elim1 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-12-05 19:32:25,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2022-12-05 19:32:26,337 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-05 19:32:26,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 60 [2022-12-05 19:32:29,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:32:29,890 INFO L321 Elim1Store]: treesize reduction 23, result has 30.3 percent of original size [2022-12-05 19:32:29,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 26 [2022-12-05 19:32:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:32:30,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:33:19,428 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (~C1~0.offset Int)) (or (let ((.cse0 (store |c_#memory_int| c_~C1~0.base (store (select |c_#memory_int| c_~C1~0.base) (+ (* c_thread1Thread1of1ForFork1_~i~0 4) ~C1~0.offset) (+ |c_thread1Thread1of1ForFork1_#t~mem2| |c_thread1Thread1of1ForFork1_#t~mem3|))))) (let ((.cse1 (let ((.cse3 (* ~M~0 4))) (store (select .cse0 c_~C2~0.base) (+ .cse3 ~C2~0.offset) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse0 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse2 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select (select (store .cse0 c_~C2~0.base .cse1) c_~C1~0.base) (+ .cse2 ~C1~0.offset)) 4294967296) (mod (select .cse1 (+ .cse2 ~C2~0.offset)) 4294967296)))) (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:21,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (~C1~0.offset Int)) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (let ((.cse2 (store |c_#memory_int| c_~C1~0.base (let ((.cse4 (* c_thread1Thread1of1ForFork1_~i~0 4))) (store (select |c_#memory_int| c_~C1~0.base) (+ .cse4 ~C1~0.offset) (+ (select (select |c_#memory_int| c_~B~0.base) (+ .cse4 c_~B~0.offset)) |c_thread1Thread1of1ForFork1_#t~mem2|)))))) (let ((.cse0 (let ((.cse3 (* ~M~0 4))) (store (select .cse2 c_~C2~0.base) (+ .cse3 ~C2~0.offset) (+ (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse1 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select .cse0 (+ .cse1 ~C2~0.offset)) 4294967296) (mod (select (select (store .cse2 c_~C2~0.base .cse0) c_~C1~0.base) (+ .cse1 ~C1~0.offset)) 4294967296)))) (< |ULTIMATE.start_main_~k~0#1| 0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:23,523 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (~C1~0.offset Int)) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (let ((.cse2 (store |c_#memory_int| c_~C1~0.base (let ((.cse4 (* c_thread1Thread1of1ForFork1_~i~0 4))) (store (select |c_#memory_int| c_~C1~0.base) (+ .cse4 ~C1~0.offset) (+ (select (select |c_#memory_int| c_~B~0.base) (+ .cse4 c_~B~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse4)))))))) (let ((.cse0 (let ((.cse3 (* ~M~0 4))) (store (select .cse2 c_~C2~0.base) (+ .cse3 ~C2~0.offset) (+ (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse1 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select .cse0 (+ .cse1 ~C2~0.offset)) 4294967296) (mod (select (select (store .cse2 c_~C2~0.base .cse0) c_~C1~0.base) (+ .cse1 ~C1~0.offset)) 4294967296)))) (< |ULTIMATE.start_main_~k~0#1| 0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:23,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (~C1~0.offset Int) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (let ((.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (store (select .cse4 c_~C1~0.base) (+ .cse5 ~C1~0.offset) (+ (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5))))))))) (let ((.cse1 (let ((.cse3 (* ~M~0 4))) (store (select .cse0 c_~C2~0.base) (+ .cse3 ~C2~0.offset) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse0 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse2 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select (select (store .cse0 c_~C2~0.base .cse1) c_~C1~0.base) (+ .cse2 ~C1~0.offset)) 4294967296) (mod (select .cse1 (+ .cse2 ~C2~0.offset)) 4294967296)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:23,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (let ((.cse0 (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (let ((.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (store (select .cse4 c_~C1~0.base) (+ .cse5 ~C1~0.offset) (+ (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5))))))))) (let ((.cse1 (let ((.cse3 (* ~M~0 4))) (store (select .cse0 c_~C2~0.base) (+ .cse3 ~C2~0.offset) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse0 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse2 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select (select (store .cse0 c_~C2~0.base .cse1) c_~C1~0.base) (+ .cse2 ~C1~0.offset)) 4294967296) (mod (select .cse1 (+ .cse2 ~C2~0.offset)) 4294967296)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:24,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (let ((.cse0 (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (store (select .cse4 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse4 c_~B~0.base) c_~B~0.offset) (select (select .cse4 c_~A~0.base) c_~A~0.offset))))))) (let ((.cse1 (let ((.cse3 (* ~M~0 4))) (store (select .cse0 c_~C2~0.base) (+ .cse3 ~C2~0.offset) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse0 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse2 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select (select (store .cse0 c_~C2~0.base .cse1) c_~C1~0.base) (+ .cse2 ~C1~0.offset)) 4294967296) (mod (select .cse1 (+ .cse2 ~C2~0.offset)) 4294967296)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:24,150 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (v_ArrVal_508 (Array Int Int)) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (let ((.cse2 (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (store (select .cse4 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse4 c_~B~0.base) c_~B~0.offset) (select (select .cse4 c_~A~0.base) c_~A~0.offset))))))) (let ((.cse0 (let ((.cse3 (* ~M~0 4))) (store (select .cse2 c_~C2~0.base) (+ .cse3 ~C2~0.offset) (+ (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse1 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select .cse0 (+ .cse1 ~C2~0.offset)) 4294967296) (mod (select (select (store .cse2 c_~C2~0.base .cse0) c_~C1~0.base) (+ .cse1 ~C1~0.offset)) 4294967296)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:24,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (v_ArrVal_508 (Array Int Int)) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (let ((.cse0 (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (store (select .cse4 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse4 c_~B~0.base) c_~B~0.offset) (select (select .cse4 c_~A~0.base) c_~A~0.offset))))))) (let ((.cse1 (let ((.cse3 (* ~M~0 4))) (store (select .cse0 |c_ULTIMATE.start_main_#t~ret15#1.base|) (+ .cse3 ~C2~0.offset) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse0 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse2 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select (select (store .cse0 |c_ULTIMATE.start_main_#t~ret15#1.base| .cse1) c_~C1~0.base) (+ .cse2 ~C1~0.offset)) 4294967296) (mod (select .cse1 (+ .cse2 ~C2~0.offset)) 4294967296)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:24,675 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (v_ArrVal_508 (Array Int Int)) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (let ((.cse2 (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (store (select .cse4 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse4 c_~B~0.base) c_~B~0.offset) (select (select .cse4 c_~A~0.base) c_~A~0.offset))))))) (let ((.cse0 (let ((.cse3 (* ~M~0 4))) (store (select .cse2 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) (+ .cse3 ~C2~0.offset) (+ (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse1 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select .cse0 (+ .cse1 ~C2~0.offset)) 4294967296) (mod (select (select (store .cse2 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| .cse0) c_~C1~0.base) (+ .cse1 ~C1~0.offset)) 4294967296)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:24,739 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (v_ArrVal_508 (Array Int Int)) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (let ((.cse2 (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (store (select .cse4 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse4 c_~B~0.base) c_~B~0.offset) (select (select .cse4 c_~A~0.base) c_~A~0.offset))))))) (let ((.cse0 (let ((.cse3 (* ~M~0 4))) (store (select .cse2 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (+ .cse3 ~C2~0.offset) (+ (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)))))) (.cse1 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select .cse0 (+ .cse1 ~C2~0.offset)) 4294967296) (mod (select (select (store .cse2 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| .cse0) c_~C1~0.base) (+ .cse1 ~C1~0.offset)) 4294967296)))) (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:24,965 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (let ((.cse0 (let ((.cse4 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (store (select .cse4 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse4 c_~A~0.base) c_~A~0.offset) (select (select .cse4 c_~B~0.base) c_~B~0.offset))))))) (let ((.cse1 (let ((.cse3 (* ~M~0 4))) (store (select .cse0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (+ .cse3 ~C2~0.offset) (+ (select (select .cse0 c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse3)))))) (.cse2 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select (select (store .cse0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| .cse1) c_~C1~0.base) (+ .cse2 ~C1~0.offset)) 4294967296) (mod (select .cse1 (+ .cse2 ~C2~0.offset)) 4294967296)))) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:25,122 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (|ULTIMATE.start_main_~k~0#1| Int) (~M~0 Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (~C1~0.offset Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (<= c_~N~0 |ULTIMATE.start_main_~k~0#1|) (let ((.cse2 (let ((.cse4 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc28#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_510))) (store .cse4 c_~C1~0.base (store (select .cse4 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse4 c_~A~0.base) c_~A~0.offset) (select (select .cse4 c_~B~0.base) c_~B~0.offset))))))) (let ((.cse0 (let ((.cse3 (* ~M~0 4))) (store (select .cse2 |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc28#1.base|) (+ .cse3 ~C2~0.offset) (+ (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)))))) (.cse1 (* |ULTIMATE.start_main_~k~0#1| 4))) (= (mod (select .cse0 (+ .cse1 ~C2~0.offset)) 4294967296) (mod (select (select (store .cse2 |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc28#1.base| .cse0) c_~C1~0.base) (+ .cse1 ~C1~0.offset)) 4294967296)))) (not (< ~M~0 c_~N~0)) (< |ULTIMATE.start_main_~k~0#1| 0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-05 19:33:37,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:33:37,306 INFO L350 Elim1Store]: Elim1 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 960 treesize of output 637 [2022-12-05 19:33:37,382 INFO L173 IndexEqualityManager]: detected equality via solver