/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:02:04,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:02:04,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:02:04,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:02:04,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:02:04,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:02:04,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:02:04,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:02:04,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:02:04,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:02:04,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:02:04,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:02:04,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:02:04,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:02:04,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:02:04,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:02:04,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:02:04,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:02:04,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:02:04,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:02:04,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:02:04,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:02:04,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:02:04,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:02:04,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:02:04,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:02:04,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:02:04,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:02:04,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:02:04,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:02:04,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:02:04,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:02:04,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:02:04,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:02:04,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:02:04,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:02:04,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:02:04,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:02:04,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:02:04,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:02:04,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:02:04,812 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:02:04,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:02:04,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:02:04,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:02:04,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:02:04,829 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:02:04,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:02:04,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:02:04,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:02:04,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:02:04,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:02:04,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:02:04,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:02:04,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:02:04,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:02:04,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:02:04,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:02:04,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:02:04,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:02:04,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:02:04,831 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:02:04,831 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-06 05:02:05,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:02:05,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:02:05,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:02:05,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:02:05,106 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:02:05,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-06 05:02:06,050 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:02:06,221 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:02:06,222 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-06 05:02:06,242 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86a2aaf2/59c88332726a4ef3be77496675d69395/FLAG28846bb69 [2022-12-06 05:02:06,255 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86a2aaf2/59c88332726a4ef3be77496675d69395 [2022-12-06 05:02:06,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:02:06,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:02:06,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:02:06,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:02:06,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:02:06,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73705723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06, skipping insertion in model container [2022-12-06 05:02:06,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:02:06,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:02:06,453 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/chl-array-int-subst.wvr.c[2781,2794] [2022-12-06 05:02:06,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:02:06,474 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:02:06,509 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/chl-array-int-subst.wvr.c[2781,2794] [2022-12-06 05:02:06,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:02:06,526 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:02:06,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06 WrapperNode [2022-12-06 05:02:06,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:02:06,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:02:06,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:02:06,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:02:06,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,591 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 281 [2022-12-06 05:02:06,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:02:06,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:02:06,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:02:06,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:02:06,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:02:06,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:02:06,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:02:06,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:02:06,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (1/1) ... [2022-12-06 05:02:06,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:02:06,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:06,667 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-06 05:02:06,690 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-06 05:02:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:02:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:02:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:02:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:02:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:02:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:02:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:02:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:02:06,702 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:02:06,832 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:02:06,834 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:02:07,193 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:02:07,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:02:07,201 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:02:07,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:02:07 BoogieIcfgContainer [2022-12-06 05:02:07,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:02:07,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:02:07,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:02:07,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:02:07,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:02:06" (1/3) ... [2022-12-06 05:02:07,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715a13d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:02:07, skipping insertion in model container [2022-12-06 05:02:07,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:06" (2/3) ... [2022-12-06 05:02:07,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715a13d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:02:07, skipping insertion in model container [2022-12-06 05:02:07,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:02:07" (3/3) ... [2022-12-06 05:02:07,209 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2022-12-06 05:02:07,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:02:07,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:02:07,222 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:02:07,312 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:02:07,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 318 transitions, 660 flow [2022-12-06 05:02:07,447 INFO L130 PetriNetUnfolder]: 29/315 cut-off events. [2022-12-06 05:02:07,447 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:02:07,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 315 events. 29/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 510 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-06 05:02:07,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 318 transitions, 660 flow [2022-12-06 05:02:07,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 305 transitions, 628 flow [2022-12-06 05:02:07,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:07,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-06 05:02:07,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 305 transitions, 628 flow [2022-12-06 05:02:07,543 INFO L130 PetriNetUnfolder]: 29/305 cut-off events. [2022-12-06 05:02:07,543 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:02:07,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 305 events. 29/305 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 509 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-06 05:02:07,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-06 05:02:07,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 14784 [2022-12-06 05:02:15,949 INFO L203 LiptonReduction]: Total number of compositions: 269 [2022-12-06 05:02:15,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:02:15,965 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=REPEATED_LIPTON_PN, 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;@3b91e310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:02:15,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:02:15,972 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-06 05:02:15,972 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:02:15,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:15,973 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] [2022-12-06 05:02:15,974 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-06 05:02:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -33773561, now seen corresponding path program 1 times [2022-12-06 05:02:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:15,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48201652] [2022-12-06 05:02:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:16,926 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-06 05:02:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:16,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48201652] [2022-12-06 05:02:16,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48201652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:16,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:16,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:02:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529851110] [2022-12-06 05:02:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:16,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:02:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:02:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:02:16,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:02:16,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 90 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-06 05:02:16,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:16,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:02:16,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:17,638 INFO L130 PetriNetUnfolder]: 1997/2838 cut-off events. [2022-12-06 05:02:17,638 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-06 05:02:17,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5910 conditions, 2838 events. 1997/2838 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11942 event pairs, 166 based on Foata normal form. 1/2235 useless extension candidates. Maximal degree in co-relation 2936. Up to 1149 conditions per place. [2022-12-06 05:02:17,649 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 118 selfloop transitions, 14 changer transitions 4/136 dead transitions. [2022-12-06 05:02:17,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 136 transitions, 607 flow [2022-12-06 05:02:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:02:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:02:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-06 05:02:17,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2022-12-06 05:02:17,661 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 90 flow. Second operand 10 states and 139 transitions. [2022-12-06 05:02:17,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 136 transitions, 607 flow [2022-12-06 05:02:17,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 136 transitions, 565 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:02:17,670 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 171 flow [2022-12-06 05:02:17,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=171, PETRI_PLACES=46, PETRI_TRANSITIONS=49} [2022-12-06 05:02:17,674 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-06 05:02:17,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:17,675 INFO L89 Accepts]: Start accepts. Operand has 46 places, 49 transitions, 171 flow [2022-12-06 05:02:17,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:17,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:17,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 49 transitions, 171 flow [2022-12-06 05:02:17,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 49 transitions, 171 flow [2022-12-06 05:02:17,689 INFO L130 PetriNetUnfolder]: 18/89 cut-off events. [2022-12-06 05:02:17,689 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:02:17,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 89 events. 18/89 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 280 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2022-12-06 05:02:17,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 49 transitions, 171 flow [2022-12-06 05:02:17,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-06 05:02:17,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1161] $Ultimate##0-->L78-2: Formula: (and (= v_~n2~0_42 (+ v_~n3~0_40 v_~res3~0_23)) (= |v_thread3Thread1of1ForFork2_~i~2#1_51| 0)) InVars {~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40} OutVars{~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_51|, ~res3~0=v_~res3~0_23} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1, ~res3~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-06 05:02:17,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1235] L66-1-->thread2EXIT: Formula: (and (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= v_~res2~0_49 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (select (select |v_#memory_int_290| v_~a3~0.base_103) (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_91|) v_~a3~0.offset_103)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483647) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_56| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483648)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|)) InVars {~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_56|, ~a3~0.base=v_~a3~0.base_103, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|} OutVars{~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_39|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, ~a3~0.base=v_~a3~0.base_103, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_43|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, ~res2~0=v_~res2~0_49} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-06 05:02:27,732 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:02:27,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10059 [2022-12-06 05:02:27,733 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 174 flow [2022-12-06 05:02:27,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-06 05:02:27,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:27,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:27,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:02:27,734 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-06 05:02:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 801774043, now seen corresponding path program 1 times [2022-12-06 05:02:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:27,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089914703] [2022-12-06 05:02:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:28,292 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-06 05:02:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:28,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089914703] [2022-12-06 05:02:28,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089914703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:28,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:28,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:02:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318201812] [2022-12-06 05:02:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:28,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:02:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:28,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:02:28,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:02:28,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:02:28,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 174 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-06 05:02:28,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:28,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:02:28,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:28,751 INFO L130 PetriNetUnfolder]: 1981/2852 cut-off events. [2022-12-06 05:02:28,751 INFO L131 PetriNetUnfolder]: For 677/677 co-relation queries the response was YES. [2022-12-06 05:02:28,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 2852 events. 1981/2852 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12199 event pairs, 424 based on Foata normal form. 1/2329 useless extension candidates. Maximal degree in co-relation 4491. Up to 1149 conditions per place. [2022-12-06 05:02:28,760 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 100 selfloop transitions, 9 changer transitions 8/117 dead transitions. [2022-12-06 05:02:28,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 117 transitions, 563 flow [2022-12-06 05:02:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:02:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:02:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-06 05:02:28,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2022-12-06 05:02:28,763 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 174 flow. Second operand 6 states and 118 transitions. [2022-12-06 05:02:28,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 117 transitions, 563 flow [2022-12-06 05:02:28,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 117 transitions, 531 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 05:02:28,769 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 163 flow [2022-12-06 05:02:28,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-06 05:02:28,770 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-06 05:02:28,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:28,770 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 163 flow [2022-12-06 05:02:28,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:28,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:28,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 163 flow [2022-12-06 05:02:28,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 163 flow [2022-12-06 05:02:28,780 INFO L130 PetriNetUnfolder]: 16/78 cut-off events. [2022-12-06 05:02:28,780 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 05:02:28,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 78 events. 16/78 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 235 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 101. Up to 8 conditions per place. [2022-12-06 05:02:28,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 163 flow [2022-12-06 05:02:28,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 05:02:28,784 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:28,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:02:28,785 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 163 flow [2022-12-06 05:02:28,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-06 05:02:28,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:28,786 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] [2022-12-06 05:02:28,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:02:28,786 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-06 05:02:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1071655459, now seen corresponding path program 1 times [2022-12-06 05:02:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:28,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876445308] [2022-12-06 05:02:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:29,084 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-06 05:02:29,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:29,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876445308] [2022-12-06 05:02:29,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876445308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:29,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:29,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:02:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248393258] [2022-12-06 05:02:29,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:29,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:02:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:29,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:02:29,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:02:29,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:02:29,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 163 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-06 05:02:29,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:29,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:02:29,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:29,581 INFO L130 PetriNetUnfolder]: 2960/4239 cut-off events. [2022-12-06 05:02:29,581 INFO L131 PetriNetUnfolder]: For 1985/1985 co-relation queries the response was YES. [2022-12-06 05:02:29,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10103 conditions, 4239 events. 2960/4239 cut-off events. For 1985/1985 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19376 event pairs, 1309 based on Foata normal form. 73/3562 useless extension candidates. Maximal degree in co-relation 8575. Up to 2401 conditions per place. [2022-12-06 05:02:29,603 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 108 selfloop transitions, 6 changer transitions 4/118 dead transitions. [2022-12-06 05:02:29,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 118 transitions, 594 flow [2022-12-06 05:02:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 05:02:29,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2022-12-06 05:02:29,604 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 163 flow. Second operand 5 states and 111 transitions. [2022-12-06 05:02:29,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 118 transitions, 594 flow [2022-12-06 05:02:29,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 118 transitions, 577 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:29,622 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 212 flow [2022-12-06 05:02:29,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2022-12-06 05:02:29,623 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-06 05:02:29,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:29,623 INFO L89 Accepts]: Start accepts. Operand has 52 places, 51 transitions, 212 flow [2022-12-06 05:02:29,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:29,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:29,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 51 transitions, 212 flow [2022-12-06 05:02:29,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 212 flow [2022-12-06 05:02:29,639 INFO L130 PetriNetUnfolder]: 24/130 cut-off events. [2022-12-06 05:02:29,639 INFO L131 PetriNetUnfolder]: For 57/58 co-relation queries the response was YES. [2022-12-06 05:02:29,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 130 events. 24/130 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 556 event pairs, 0 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 189. Up to 11 conditions per place. [2022-12-06 05:02:29,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 51 transitions, 212 flow [2022-12-06 05:02:29,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-06 05:02:29,642 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:29,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 05:02:29,643 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 212 flow [2022-12-06 05:02:29,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-06 05:02:29,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:29,644 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] [2022-12-06 05:02:29,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:02:29,644 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-06 05:02:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash -112413539, now seen corresponding path program 2 times [2022-12-06 05:02:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:29,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94894189] [2022-12-06 05:02:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:29,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:29,962 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-06 05:02:29,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:29,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94894189] [2022-12-06 05:02:29,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94894189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:29,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:29,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:02:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393303668] [2022-12-06 05:02:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:29,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:02:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:02:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:02:29,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:02:29,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 212 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-06 05:02:29,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:29,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:02:29,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:30,478 INFO L130 PetriNetUnfolder]: 2858/4136 cut-off events. [2022-12-06 05:02:30,478 INFO L131 PetriNetUnfolder]: For 3472/3472 co-relation queries the response was YES. [2022-12-06 05:02:30,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10337 conditions, 4136 events. 2858/4136 cut-off events. For 3472/3472 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18869 event pairs, 1451 based on Foata normal form. 103/3490 useless extension candidates. Maximal degree in co-relation 8837. Up to 2401 conditions per place. [2022-12-06 05:02:30,495 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 105 selfloop transitions, 6 changer transitions 6/117 dead transitions. [2022-12-06 05:02:30,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 117 transitions, 608 flow [2022-12-06 05:02:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 05:02:30,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2022-12-06 05:02:30,497 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 212 flow. Second operand 5 states and 111 transitions. [2022-12-06 05:02:30,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 117 transitions, 608 flow [2022-12-06 05:02:30,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 117 transitions, 594 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 05:02:30,513 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 254 flow [2022-12-06 05:02:30,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2022-12-06 05:02:30,514 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 05:02:30,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:30,514 INFO L89 Accepts]: Start accepts. Operand has 59 places, 54 transitions, 254 flow [2022-12-06 05:02:30,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:30,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:30,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 254 flow [2022-12-06 05:02:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 254 flow [2022-12-06 05:02:30,525 INFO L130 PetriNetUnfolder]: 22/127 cut-off events. [2022-12-06 05:02:30,525 INFO L131 PetriNetUnfolder]: For 82/83 co-relation queries the response was YES. [2022-12-06 05:02:30,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 127 events. 22/127 cut-off events. For 82/83 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 550 event pairs, 0 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 200. Up to 10 conditions per place. [2022-12-06 05:02:30,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 254 flow [2022-12-06 05:02:30,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 05:02:30,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1235] L66-1-->thread2EXIT: Formula: (and (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= v_~res2~0_49 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (select (select |v_#memory_int_290| v_~a3~0.base_103) (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_91|) v_~a3~0.offset_103)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483647) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_56| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483648)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|)) InVars {~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_56|, ~a3~0.base=v_~a3~0.base_103, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|} OutVars{~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_39|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, ~a3~0.base=v_~a3~0.base_103, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_43|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, ~res2~0=v_~res2~0_49} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-06 05:02:30,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1161] $Ultimate##0-->L78-2: Formula: (and (= v_~n2~0_42 (+ v_~n3~0_40 v_~res3~0_23)) (= |v_thread3Thread1of1ForFork2_~i~2#1_51| 0)) InVars {~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40} OutVars{~n2~0=v_~n2~0_42, ~n3~0=v_~n3~0_40, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_51|, ~res3~0=v_~res3~0_23} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1, ~res3~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-06 05:02:30,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:30,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 05:02:30,637 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 266 flow [2022-12-06 05:02:30,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-06 05:02:30,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:30,637 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] [2022-12-06 05:02:30,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:02:30,637 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-06 05:02:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1384747613, now seen corresponding path program 1 times [2022-12-06 05:02:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:30,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319534174] [2022-12-06 05:02:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:30,706 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-06 05:02:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:30,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319534174] [2022-12-06 05:02:30,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319534174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:30,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:30,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:02:30,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781279256] [2022-12-06 05:02:30,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:30,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:30,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:02:30,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 266 flow. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-06 05:02:30,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:30,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:02:30,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:31,243 INFO L130 PetriNetUnfolder]: 3810/5500 cut-off events. [2022-12-06 05:02:31,243 INFO L131 PetriNetUnfolder]: For 6728/6728 co-relation queries the response was YES. [2022-12-06 05:02:31,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14562 conditions, 5500 events. 3810/5500 cut-off events. For 6728/6728 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 26577 event pairs, 2210 based on Foata normal form. 1/4522 useless extension candidates. Maximal degree in co-relation 13050. Up to 4022 conditions per place. [2022-12-06 05:02:31,282 INFO L137 encePairwiseOnDemand]: 37/41 looper letters, 99 selfloop transitions, 3 changer transitions 7/109 dead transitions. [2022-12-06 05:02:31,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 661 flow [2022-12-06 05:02:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:02:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:02:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 05:02:31,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2022-12-06 05:02:31,284 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 266 flow. Second operand 4 states and 94 transitions. [2022-12-06 05:02:31,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 661 flow [2022-12-06 05:02:31,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 658 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:31,343 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 243 flow [2022-12-06 05:02:31,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2022-12-06 05:02:31,345 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2022-12-06 05:02:31,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:31,346 INFO L89 Accepts]: Start accepts. Operand has 63 places, 53 transitions, 243 flow [2022-12-06 05:02:31,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:31,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:31,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 53 transitions, 243 flow [2022-12-06 05:02:31,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 53 transitions, 243 flow [2022-12-06 05:02:31,370 INFO L130 PetriNetUnfolder]: 27/157 cut-off events. [2022-12-06 05:02:31,370 INFO L131 PetriNetUnfolder]: For 113/114 co-relation queries the response was YES. [2022-12-06 05:02:31,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 157 events. 27/157 cut-off events. For 113/114 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 763 event pairs, 0 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 246. Up to 12 conditions per place. [2022-12-06 05:02:31,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 53 transitions, 243 flow [2022-12-06 05:02:31,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-06 05:02:31,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 05:02:31,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1235] L66-1-->thread2EXIT: Formula: (and (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= v_~res2~0_49 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (select (select |v_#memory_int_290| v_~a3~0.base_103) (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_91|) v_~a3~0.offset_103)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483647) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_56| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_47| 2147483648)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|)) InVars {~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_56|, ~a3~0.base=v_~a3~0.base_103, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|} OutVars{~a3~0.offset=v_~a3~0.offset_103, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_39|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_91|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, ~a3~0.base=v_~a3~0.base_103, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_43|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, ~res2~0=v_~res2~0_49} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [1211] $Ultimate##0-->L64-2: Formula: (and (= v_~n1~0_54 (+ v_~n3~0_70 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_85|)) InVars {~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54} OutVars{~n3~0=v_~n3~0_70, ~n1~0=v_~n1~0_54, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_85|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] [2022-12-06 05:02:31,572 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:02:31,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 05:02:31,573 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 250 flow [2022-12-06 05:02:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-06 05:02:31,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:31,573 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] [2022-12-06 05:02:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:02:31,574 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-06 05:02:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 582170171, now seen corresponding path program 1 times [2022-12-06 05:02:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683581554] [2022-12-06 05:02:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:31,678 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-06 05:02:31,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:31,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683581554] [2022-12-06 05:02:31,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683581554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:31,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:31,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:02:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485576305] [2022-12-06 05:02:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:31,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:02:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:31,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:02:31,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:31,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:02:31,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 250 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-06 05:02:31,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:31,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:02:31,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:32,452 INFO L130 PetriNetUnfolder]: 5307/7609 cut-off events. [2022-12-06 05:02:32,452 INFO L131 PetriNetUnfolder]: For 11305/11305 co-relation queries the response was YES. [2022-12-06 05:02:32,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21484 conditions, 7609 events. 5307/7609 cut-off events. For 11305/11305 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 37881 event pairs, 2678 based on Foata normal form. 2/6290 useless extension candidates. Maximal degree in co-relation 19912. Up to 4654 conditions per place. [2022-12-06 05:02:32,477 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 139 selfloop transitions, 9 changer transitions 14/162 dead transitions. [2022-12-06 05:02:32,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 162 transitions, 957 flow [2022-12-06 05:02:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:02:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:02:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2022-12-06 05:02:32,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2022-12-06 05:02:32,479 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 250 flow. Second operand 8 states and 145 transitions. [2022-12-06 05:02:32,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 162 transitions, 957 flow [2022-12-06 05:02:32,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 162 transitions, 926 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 05:02:32,500 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 260 flow [2022-12-06 05:02:32,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2022-12-06 05:02:32,502 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2022-12-06 05:02:32,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:32,502 INFO L89 Accepts]: Start accepts. Operand has 69 places, 55 transitions, 260 flow [2022-12-06 05:02:32,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:32,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:32,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 55 transitions, 260 flow [2022-12-06 05:02:32,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 55 transitions, 260 flow [2022-12-06 05:02:32,522 INFO L130 PetriNetUnfolder]: 31/192 cut-off events. [2022-12-06 05:02:32,523 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 05:02:32,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 192 events. 31/192 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1013 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 313. Up to 15 conditions per place. [2022-12-06 05:02:32,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 55 transitions, 260 flow [2022-12-06 05:02:32,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 05:02:32,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 05:02:33,307 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:02:33,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 806 [2022-12-06 05:02:33,308 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 260 flow [2022-12-06 05:02:33,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-06 05:02:33,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:33,308 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] [2022-12-06 05:02:33,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:02:33,309 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-06 05:02:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash 314961450, now seen corresponding path program 1 times [2022-12-06 05:02:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:33,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663354831] [2022-12-06 05:02:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:33,352 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-06 05:02:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:33,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663354831] [2022-12-06 05:02:33,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663354831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:33,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:33,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000985649] [2022-12-06 05:02:33,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:33,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:33,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:33,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:33,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:02:33,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-06 05:02:33,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:33,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:02:33,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:33,735 INFO L130 PetriNetUnfolder]: 3256/4697 cut-off events. [2022-12-06 05:02:33,735 INFO L131 PetriNetUnfolder]: For 5857/5857 co-relation queries the response was YES. [2022-12-06 05:02:33,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13427 conditions, 4697 events. 3256/4697 cut-off events. For 5857/5857 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21434 event pairs, 1931 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 12909. Up to 3882 conditions per place. [2022-12-06 05:02:33,752 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 41 selfloop transitions, 0 changer transitions 42/83 dead transitions. [2022-12-06 05:02:33,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 487 flow [2022-12-06 05:02:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:02:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:02:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 05:02:33,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 05:02:33,753 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 260 flow. Second operand 4 states and 76 transitions. [2022-12-06 05:02:33,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 487 flow [2022-12-06 05:02:33,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 436 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-06 05:02:33,771 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 140 flow [2022-12-06 05:02:33,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2022-12-06 05:02:33,772 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-06 05:02:33,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:33,772 INFO L89 Accepts]: Start accepts. Operand has 60 places, 41 transitions, 140 flow [2022-12-06 05:02:33,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:33,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:33,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 41 transitions, 140 flow [2022-12-06 05:02:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 140 flow [2022-12-06 05:02:33,779 INFO L130 PetriNetUnfolder]: 16/80 cut-off events. [2022-12-06 05:02:33,779 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-06 05:02:33,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 80 events. 16/80 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 240 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 124. Up to 9 conditions per place. [2022-12-06 05:02:33,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 140 flow [2022-12-06 05:02:33,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 05:02:33,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 05:02:33,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:33,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 05:02:33,868 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 142 flow [2022-12-06 05:02:33,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-06 05:02:33,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:33,868 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] [2022-12-06 05:02:33,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:02:33,869 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-06 05:02:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2068596558, now seen corresponding path program 1 times [2022-12-06 05:02:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:33,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340233750] [2022-12-06 05:02:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:33,957 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-06 05:02:33,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:33,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340233750] [2022-12-06 05:02:33,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340233750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:33,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:33,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:02:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047572369] [2022-12-06 05:02:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:02:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:02:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:02:33,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:02:33,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 142 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-06 05:02:33,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:33,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:02:33,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:34,288 INFO L130 PetriNetUnfolder]: 2465/3451 cut-off events. [2022-12-06 05:02:34,288 INFO L131 PetriNetUnfolder]: For 2581/2581 co-relation queries the response was YES. [2022-12-06 05:02:34,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9061 conditions, 3451 events. 2465/3451 cut-off events. For 2581/2581 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14478 event pairs, 1114 based on Foata normal form. 1/2996 useless extension candidates. Maximal degree in co-relation 9041. Up to 1278 conditions per place. [2022-12-06 05:02:34,298 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 56 selfloop transitions, 4 changer transitions 54/114 dead transitions. [2022-12-06 05:02:34,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 114 transitions, 597 flow [2022-12-06 05:02:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-06 05:02:34,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2022-12-06 05:02:34,299 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 142 flow. Second operand 5 states and 107 transitions. [2022-12-06 05:02:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 114 transitions, 597 flow [2022-12-06 05:02:34,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 114 transitions, 543 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-06 05:02:34,311 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 131 flow [2022-12-06 05:02:34,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-06 05:02:34,312 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-06 05:02:34,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:34,312 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 131 flow [2022-12-06 05:02:34,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:34,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:34,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 131 flow [2022-12-06 05:02:34,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 131 flow [2022-12-06 05:02:34,317 INFO L130 PetriNetUnfolder]: 11/45 cut-off events. [2022-12-06 05:02:34,317 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:02:34,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 45 events. 11/45 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 70. Up to 6 conditions per place. [2022-12-06 05:02:34,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 131 flow [2022-12-06 05:02:34,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 05:02:34,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1242] L52-1-->thread1EXIT: Formula: (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_41| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_41|) |v_thread1Thread1of1ForFork0_minus_~a#1_57|) (= v_~res1~0_55 |v_thread1Thread1of1ForFork0_minus_#res#1_41|) (= (select (select |v_#memory_int_308| v_~a2~0.base_91) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_87| 4) v_~a2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_25|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_25| |v_thread1Thread1of1ForFork0_#t~mem3#1_50|)) InVars {~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, #memory_int=|v_#memory_int_308|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_50|, ~a2~0.offset=v_~a2~0.offset_91} OutVars{~res1~0=v_~res1~0_55, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_41|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_41|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_25|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~a2~0.base=v_~a2~0.base_91, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_33|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, #memory_int=|v_#memory_int_308|, ~a2~0.offset=v_~a2~0.offset_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [1052] $Ultimate##0-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_37| 0) (= v_~n1~0_20 (+ v_~n2~0_24 v_~res1~0_15))) InVars {~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_24, ~n1~0=v_~n1~0_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 05:02:34,410 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 05:02:34,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:34,414 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 05:02:34,415 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 127 flow [2022-12-06 05:02:34,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:34,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:02:34,415 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:02:34,419 INFO L158 Benchmark]: Toolchain (without parser) took 28160.65ms. Allocated memory was 215.0MB in the beginning and 513.8MB in the end (delta: 298.8MB). Free memory was 176.2MB in the beginning and 143.5MB in the end (delta: 32.7MB). Peak memory consumption was 332.1MB. Max. memory is 8.0GB. [2022-12-06 05:02:34,419 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory is still 191.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:02:34,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.64ms. Allocated memory is still 215.0MB. Free memory was 176.2MB in the beginning and 164.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:02:34,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.91ms. Allocated memory is still 215.0MB. Free memory was 163.6MB in the beginning and 161.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:02:34,420 INFO L158 Benchmark]: Boogie Preprocessor took 38.21ms. Allocated memory is still 215.0MB. Free memory was 161.0MB in the beginning and 159.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:02:34,420 INFO L158 Benchmark]: RCFGBuilder took 572.76ms. Allocated memory is still 215.0MB. Free memory was 158.9MB in the beginning and 134.2MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 05:02:34,420 INFO L158 Benchmark]: TraceAbstraction took 27213.90ms. Allocated memory was 215.0MB in the beginning and 513.8MB in the end (delta: 298.8MB). Free memory was 133.2MB in the beginning and 143.5MB in the end (delta: -10.3MB). Peak memory consumption was 289.1MB. Max. memory is 8.0GB. [2022-12-06 05:02:34,421 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory is still 191.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.64ms. Allocated memory is still 215.0MB. Free memory was 176.2MB in the beginning and 164.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.91ms. Allocated memory is still 215.0MB. Free memory was 163.6MB in the beginning and 161.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.21ms. Allocated memory is still 215.0MB. Free memory was 161.0MB in the beginning and 159.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 572.76ms. Allocated memory is still 215.0MB. Free memory was 158.9MB in the beginning and 134.2MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 27213.90ms. Allocated memory was 215.0MB in the beginning and 513.8MB in the end (delta: 298.8MB). Free memory was 133.2MB in the beginning and 143.5MB in the end (delta: -10.3MB). Peak memory consumption was 289.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 286 PlacesBefore, 38 PlacesAfterwards, 305 TransitionsBefore, 36 TransitionsAfterwards, 14784 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 117 ConcurrentYvCompositions, 21 ChoiceCompositions, 269 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 10015, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10081, independent: 1512, independent conditional: 0, independent unconditional: 1512, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 8536, unknown conditional: 0, unknown unconditional: 8536] , Statistics on independence cache: Total cache size (in pairs): 17022, Positive cache size: 16989, Positive conditional cache size: 0, Positive unconditional cache size: 16989, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 46 PlacesBefore, 43 PlacesAfterwards, 49 TransitionsBefore, 46 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 342, independent: 310, independent conditional: 310, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 342, independent: 310, independent conditional: 54, independent unconditional: 256, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 342, independent: 310, independent conditional: 47, independent unconditional: 263, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 342, independent: 310, independent conditional: 47, independent unconditional: 263, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 142, independent: 129, independent conditional: 28, independent unconditional: 101, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 142, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 342, independent: 181, independent conditional: 19, independent unconditional: 162, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 142, unknown conditional: 28, unknown unconditional: 114] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 129, Positive conditional cache size: 28, Positive unconditional cache size: 101, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 153, independent: 136, independent conditional: 16, independent unconditional: 120, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 136, independent conditional: 4, independent unconditional: 132, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 136, independent conditional: 4, independent unconditional: 132, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 129, independent conditional: 4, independent unconditional: 125, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 136, Positive conditional cache size: 28, Positive unconditional cache size: 108, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 99, independent conditional: 11, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 136, Positive conditional cache size: 28, Positive unconditional cache size: 108, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 59 PlacesBefore, 59 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 262, independent conditional: 70, independent unconditional: 192, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 262, independent conditional: 63, independent unconditional: 199, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 262, independent conditional: 63, independent unconditional: 199, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 302, independent: 250, independent conditional: 51, independent unconditional: 199, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 162, Positive conditional cache size: 40, Positive unconditional cache size: 122, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 62 PlacesBefore, 62 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 320, independent: 278, independent conditional: 278, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 320, independent: 278, independent conditional: 102, independent unconditional: 176, dependent: 42, dependent conditional: 2, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 320, independent: 278, independent conditional: 86, independent unconditional: 192, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 278, independent conditional: 86, independent unconditional: 192, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 320, independent: 252, independent conditional: 72, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 28, unknown conditional: 14, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 206, Positive conditional cache size: 57, Positive unconditional cache size: 149, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 67 PlacesBefore, 66 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 328, independent conditional: 328, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 369, independent: 328, independent conditional: 128, independent unconditional: 200, dependent: 41, dependent conditional: 1, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 328, independent conditional: 103, independent unconditional: 225, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 328, independent conditional: 103, independent unconditional: 225, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 12, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 369, independent: 309, independent conditional: 91, independent unconditional: 218, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 19, unknown conditional: 12, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 236, Positive conditional cache size: 71, Positive unconditional cache size: 165, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 224, independent: 189, independent conditional: 51, independent unconditional: 138, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 189, independent conditional: 45, independent unconditional: 144, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 189, independent conditional: 45, independent unconditional: 144, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 13, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 175, independent conditional: 32, independent unconditional: 143, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 15, unknown conditional: 14, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 261, Positive conditional cache size: 86, Positive unconditional cache size: 175, Negative cache size: 16, Negative conditional cache size: 1, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 197, independent: 159, independent conditional: 65, independent unconditional: 94, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, independent: 159, independent conditional: 61, independent unconditional: 98, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 197, independent: 159, independent conditional: 61, independent unconditional: 98, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 197, independent: 146, independent conditional: 48, independent unconditional: 98, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 285, Positive conditional cache size: 101, Positive unconditional cache size: 184, Negative cache size: 21, Negative conditional cache size: 6, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:02:34,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...