/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-exp-term-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:05:45,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:05:45,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:05:45,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:05:45,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:05:45,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:05:45,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:05:45,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:05:45,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:05:45,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:05:45,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:05:45,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:05:45,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:05:45,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:05:45,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:05:45,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:05:45,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:05:45,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:05:45,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:05:45,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:05:45,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:05:45,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:05:45,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:05:45,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:05:45,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:05:45,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:05:45,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:05:45,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:05:45,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:05:45,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:05:45,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:05:45,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:05:45,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:05:45,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:05:45,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:05:45,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:05:45,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:05:45,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:05:45,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:05:45,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:05:45,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:05:45,805 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:05:45,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:05:45,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:05:45,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:05:45,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:05:45,840 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:05:45,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:05:45,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:05:45,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:05:45,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:05:45,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:05:45,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:05:45,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:05:45,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:05:45,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:05:45,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:05:45,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:05:45,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:05:45,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:05:45,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:05:45,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:05:45,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:05:45,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:05:45,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:05:45,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:05:45,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:05:45,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:05:45,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:05:45,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:05:45,845 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:05:46,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:05:46,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:05:46,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:05:46,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:05:46,190 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:05:46,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2022-12-06 05:05:47,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:05:47,439 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:05:47,439 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2022-12-06 05:05:47,446 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210669290/d1163697aac44c4f8bb4ce4b30faffbb/FLAG5ad341ec1 [2022-12-06 05:05:47,459 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210669290/d1163697aac44c4f8bb4ce4b30faffbb [2022-12-06 05:05:47,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:05:47,462 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:05:47,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:05:47,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:05:47,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:05:47,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7005386c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47, skipping insertion in model container [2022-12-06 05:05:47,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:05:47,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:05:47,686 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-exp-term-subst.wvr.c[3072,3085] [2022-12-06 05:05:47,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:05:47,707 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:05:47,746 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-exp-term-subst.wvr.c[3072,3085] [2022-12-06 05:05:47,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:05:47,761 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:05:47,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47 WrapperNode [2022-12-06 05:05:47,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:05:47,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:05:47,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:05:47,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:05:47,770 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:05:47" (1/1) ... [2022-12-06 05:05:47,788 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:05:47" (1/1) ... [2022-12-06 05:05:47,827 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 176 [2022-12-06 05:05:47,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:05:47,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:05:47,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:05:47,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:05:47,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:05:47,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:05:47,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:05:47,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:05:47,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (1/1) ... [2022-12-06 05:05:47,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:05:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:47,900 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:05:47,915 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:05:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:05:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:05:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:05:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:05:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:05:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:05:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:05:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:05:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:05:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:05:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:05:47,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:05:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:05:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:05:47,940 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:05:48,093 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:05:48,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:05:48,418 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:05:48,426 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:05:48,427 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 05:05:48,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:05:48 BoogieIcfgContainer [2022-12-06 05:05:48,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:05:48,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:05:48,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:05:48,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:05:48,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:05:47" (1/3) ... [2022-12-06 05:05:48,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234d4dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:05:48, skipping insertion in model container [2022-12-06 05:05:48,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:05:47" (2/3) ... [2022-12-06 05:05:48,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234d4dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:05:48, skipping insertion in model container [2022-12-06 05:05:48,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:05:48" (3/3) ... [2022-12-06 05:05:48,435 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2022-12-06 05:05:48,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:05:48,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:05:48,451 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:05:48,552 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:05:48,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 207 transitions, 438 flow [2022-12-06 05:05:48,688 INFO L130 PetriNetUnfolder]: 17/204 cut-off events. [2022-12-06 05:05:48,689 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:05:48,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 17/204 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-12-06 05:05:48,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 207 transitions, 438 flow [2022-12-06 05:05:48,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 194 transitions, 406 flow [2022-12-06 05:05:48,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:48,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 194 transitions, 406 flow [2022-12-06 05:05:48,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 194 transitions, 406 flow [2022-12-06 05:05:48,802 INFO L130 PetriNetUnfolder]: 17/194 cut-off events. [2022-12-06 05:05:48,803 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:05:48,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 194 events. 17/194 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-12-06 05:05:48,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 194 transitions, 406 flow [2022-12-06 05:05:48,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 11934 [2022-12-06 05:05:55,783 INFO L203 LiptonReduction]: Total number of compositions: 175 [2022-12-06 05:05:55,802 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:05:55,811 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;@5723e91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:05:55,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:05:55,817 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 05:05:55,817 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:05:55,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:55,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:55,819 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:05:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:55,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1066200075, now seen corresponding path program 1 times [2022-12-06 05:05:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:55,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106580840] [2022-12-06 05:05:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:55,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:58,981 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:05:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:58,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106580840] [2022-12-06 05:05:58,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106580840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:05:58,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:05:58,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:05:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972516162] [2022-12-06 05:05:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:05:58,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:05:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:05:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:05:59,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:05:59,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:05:59,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:59,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:05:59,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:59,626 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-06 05:05:59,627 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 05:05:59,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 281 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 37 conditions per place. [2022-12-06 05:05:59,628 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-06 05:05:59,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 45 transitions, 228 flow [2022-12-06 05:05:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:05:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:05:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-12-06 05:05:59,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 05:05:59,645 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 7 states and 46 transitions. [2022-12-06 05:05:59,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 45 transitions, 228 flow [2022-12-06 05:05:59,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:05:59,650 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 71 flow [2022-12-06 05:05:59,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=71, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2022-12-06 05:05:59,654 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-12-06 05:05:59,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:59,655 INFO L89 Accepts]: Start accepts. Operand has 29 places, 20 transitions, 71 flow [2022-12-06 05:05:59,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:59,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:59,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 20 transitions, 71 flow [2022-12-06 05:05:59,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 20 transitions, 71 flow [2022-12-06 05:05:59,666 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-06 05:05:59,666 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:05:59,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 2/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2022-12-06 05:05:59,667 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-06 05:05:59,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 05:05:59,695 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [837] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= |v_thread3Thread1of1ForFork1_#res#1.offset_Out_22| 0)) (.cse4 (= v_~sort_label_2~0_In_12 v_~sort_label_4~0_In_14)) (.cse1 (= (mod v_~sort_label_is_null_3~0_In_12 256) 0)) (.cse7 (= (mod v_~sort_label_is_null_5~0_In_13 256) 0)) (.cse3 (= |v_thread3Thread1of1ForFork1_#res#1.base_Out_22| 0))) (or (and (= |v_thread3Thread1of1ForFork1_minus_~a#1_In_7| |v_thread3Thread1of1ForFork1_minus_~a#1_Out_12|) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork1_minus_#in~a#1_In_3|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|) (= |v_thread3Thread1of1ForFork1_minus_#in~b#1_In_4| |v_thread3Thread1of1ForFork1_minus_#in~b#1_Out_10|) (let ((.cse6 (not .cse1)) (.cse2 (not .cse7))) (let ((.cse5 (= (ite .cse6 1 0) (ite .cse2 1 0)))) (or (and .cse0 .cse1 (= v_~result_8~0_Out_24 1) .cse2 .cse3) (and (= v_~result_8~0_Out_24 0) (or .cse4 .cse2) .cse0 .cse5 .cse3) (and .cse0 .cse6 (= (+ v_~result_8~0_Out_24 1) 0) (not .cse5) .cse3)))) (= |v_thread3Thread1of1ForFork1_minus_#res#1_Out_16| |v_thread3Thread1of1ForFork1_minus_#res#1_In_2|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_3|) (= |v_thread3Thread1of1ForFork1_minus_~b#1_In_6| |v_thread3Thread1of1ForFork1_minus_~b#1_Out_14|)) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= (+ |v_thread3Thread1of1ForFork1_minus_#res#1_Out_16| |v_thread3Thread1of1ForFork1_minus_~b#1_Out_14|) |v_thread3Thread1of1ForFork1_minus_~a#1_Out_12|) (= v_~result_8~0_Out_24 |v_thread3Thread1of1ForFork1_minus_#res#1_Out_16|) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_Out_10| v_~sort_label_2~0_In_12) .cse0 (not .cse4) (= |v_thread3Thread1of1ForFork1_minus_#in~b#1_Out_10| |v_thread3Thread1of1ForFork1_minus_~b#1_Out_14|) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_Out_10| |v_thread3Thread1of1ForFork1_minus_~a#1_Out_12|) (= |v_thread3Thread1of1ForFork1_minus_#in~b#1_Out_10| v_~sort_label_4~0_In_14) .cse1 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= |v_thread3Thread1of1ForFork1_minus_~a#1_Out_12| (+ 2147483647 |v_thread3Thread1of1ForFork1_minus_~b#1_Out_14|)) (<= 0 |v_thread3Thread1of1ForFork1_minus_~b#1_Out_14|)) 1 0)) (<= v_~result_8~0_Out_24 2147483647) (<= 0 (+ v_~result_8~0_Out_24 2147483648)) .cse7 .cse3))) InVars {thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_3|, thread3Thread1of1ForFork1_minus_#res#1=|v_thread3Thread1of1ForFork1_minus_#res#1_In_2|, ~sort_label_2~0=v_~sort_label_2~0_In_12, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|, ~sort_label_4~0=v_~sort_label_4~0_In_14, ~sort_label_is_null_5~0=v_~sort_label_is_null_5~0_In_13, thread3Thread1of1ForFork1_minus_~b#1=|v_thread3Thread1of1ForFork1_minus_~b#1_In_6|, thread3Thread1of1ForFork1_minus_~a#1=|v_thread3Thread1of1ForFork1_minus_~a#1_In_7|, ~sort_label_is_null_3~0=v_~sort_label_is_null_3~0_In_12, thread3Thread1of1ForFork1_minus_#in~a#1=|v_thread3Thread1of1ForFork1_minus_#in~a#1_In_3|, thread3Thread1of1ForFork1_minus_#in~b#1=|v_thread3Thread1of1ForFork1_minus_#in~b#1_In_4|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork1_#t~ite12#1=|v_thread3Thread1of1ForFork1_#t~ite12#1_Out_18|, thread3Thread1of1ForFork1_#t~ret9#1=|v_thread3Thread1of1ForFork1_#t~ret9#1_Out_24|, ~sort_label_2~0=v_~sort_label_2~0_In_12, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|, ~sort_label_4~0=v_~sort_label_4~0_In_14, ~sort_label_is_null_5~0=v_~sort_label_is_null_5~0_In_13, ~result_8~0=v_~result_8~0_Out_24, thread3Thread1of1ForFork1_minus_~a#1=|v_thread3Thread1of1ForFork1_minus_~a#1_Out_12|, ~sort_label_is_null_3~0=v_~sort_label_is_null_3~0_In_12, thread3Thread1of1ForFork1_minus_#in~b#1=|v_thread3Thread1of1ForFork1_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork1_minus_#res#1=|v_thread3Thread1of1ForFork1_minus_#res#1_Out_16|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_Out_22|, thread3Thread1of1ForFork1_#t~ite10#1=|v_thread3Thread1of1ForFork1_#t~ite10#1_Out_24|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_Out_22|, thread3Thread1of1ForFork1_#t~ite11#1=|v_thread3Thread1of1ForFork1_#t~ite11#1_Out_26|, thread3Thread1of1ForFork1_minus_~b#1=|v_thread3Thread1of1ForFork1_minus_~b#1_Out_14|, thread3Thread1of1ForFork1_minus_#in~a#1=|v_thread3Thread1of1ForFork1_minus_#in~a#1_Out_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~ite12#1, thread3Thread1of1ForFork1_#t~ret9#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~result_8~0, thread3Thread1of1ForFork1_minus_~a#1, thread3Thread1of1ForFork1_minus_#in~b#1, thread3Thread1of1ForFork1_minus_#res#1, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#t~ite10#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~ite11#1, thread3Thread1of1ForFork1_minus_~b#1, thread3Thread1of1ForFork1_minus_#in~a#1] and [839] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse5 (= (mod v_~sort_label_is_null_1~0_In_13 256) 0)) (.cse7 (= (mod v_~sort_label_is_null_3~0_In_14 256) 0)) (.cse4 (= v_~sort_label_0~0_In_15 v_~sort_label_2~0_In_14)) (.cse2 (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_22| 0)) (.cse3 (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_22| 0))) (or (and (= |v_thread1Thread1of1ForFork2_minus_~a#1_In_8| |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_26|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| |v_thread1Thread1of1ForFork2_minus_#res#1_In_2|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14| |v_thread1Thread1of1ForFork2_minus_~b#1_In_8|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_5| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_In_4| |v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8| |v_thread1Thread1of1ForFork2_minus_#in~a#1_In_3|) (let ((.cse1 (not .cse5)) (.cse6 (not .cse7))) (let ((.cse0 (= (ite .cse1 1 0) (ite .cse6 1 0)))) (or (and (not .cse0) (= (+ v_~result_6~0_Out_28 1) 0) .cse1 .cse2 .cse3) (and (or .cse1 .cse4) .cse0 (= v_~result_6~0_Out_28 0) .cse2 .cse3) (and .cse5 .cse6 (= v_~result_6~0_Out_28 1) .cse2 .cse3))))) (and (= |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| v_~result_6~0_Out_28) (= v_~sort_label_2~0_In_14 |v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_26| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|) .cse5 .cse7 (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8| v_~sort_label_0~0_In_15) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8| |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14| |v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|) (<= 0 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| 2147483648)) (= |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12| (+ |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12| (+ 2147483647 |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|) (not .cse4) (<= |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| 2147483647) .cse2 .cse3))) InVars {~sort_label_0~0=v_~sort_label_0~0_In_15, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_In_4|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_In_3|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_In_8|, ~sort_label_2~0=v_~sort_label_2~0_In_14, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_5|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_In_8|, ~sort_label_is_null_3~0=v_~sort_label_is_null_3~0_In_14, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3|, ~sort_label_is_null_1~0=v_~sort_label_is_null_1~0_In_13} OutVars{~sort_label_0~0=v_~sort_label_0~0_In_15, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_Out_24|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_Out_32|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8|, ~sort_label_2~0=v_~sort_label_2~0_In_14, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_Out_18|, ~sort_label_is_null_3~0=v_~sort_label_is_null_3~0_In_14, ~result_6~0=v_~result_6~0_Out_28, ~sort_label_is_null_1~0=v_~sort_label_is_null_1~0_In_13, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_Out_22|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_Out_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_22|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_Out_12|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_22|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_minus_#res#1, ~result_6~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:06:00,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:00,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 810 [2022-12-06 05:06:00,464 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 78 flow [2022-12-06 05:06:00,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:06:00,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:00,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:06:00,465 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:06:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash 828245955, now seen corresponding path program 2 times [2022-12-06 05:06:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:00,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790708971] [2022-12-06 05:06:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:01,934 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:06:01,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:01,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790708971] [2022-12-06 05:06:01,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790708971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:01,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:01,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:06:01,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066153022] [2022-12-06 05:06:01,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:01,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:06:01,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:01,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:06:01,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:06:01,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:06:01,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:06:01,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:01,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:06:01,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:02,279 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-06 05:06:02,279 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 05:06:02,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 427 event pairs, 6 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-06 05:06:02,281 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 10/47 dead transitions. [2022-12-06 05:06:02,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 244 flow [2022-12-06 05:06:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:06:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:06:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 05:06:02,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 05:06:02,283 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 78 flow. Second operand 6 states and 47 transitions. [2022-12-06 05:06:02,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 244 flow [2022-12-06 05:06:02,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 239 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:06:02,286 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 109 flow [2022-12-06 05:06:02,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 05:06:02,287 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 05:06:02,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:02,287 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 109 flow [2022-12-06 05:06:02,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:02,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:02,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 109 flow [2022-12-06 05:06:02,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 109 flow [2022-12-06 05:06:02,297 INFO L130 PetriNetUnfolder]: 1/42 cut-off events. [2022-12-06 05:06:02,297 INFO L131 PetriNetUnfolder]: For 45/51 co-relation queries the response was YES. [2022-12-06 05:06:02,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 42 events. 1/42 cut-off events. For 45/51 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2022-12-06 05:06:02,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 109 flow [2022-12-06 05:06:02,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:06:02,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [839] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse5 (= (mod v_~sort_label_is_null_1~0_In_13 256) 0)) (.cse7 (= (mod v_~sort_label_is_null_3~0_In_14 256) 0)) (.cse4 (= v_~sort_label_0~0_In_15 v_~sort_label_2~0_In_14)) (.cse2 (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_22| 0)) (.cse3 (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_22| 0))) (or (and (= |v_thread1Thread1of1ForFork2_minus_~a#1_In_8| |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_26|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| |v_thread1Thread1of1ForFork2_minus_#res#1_In_2|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14| |v_thread1Thread1of1ForFork2_minus_~b#1_In_8|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_5| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_In_4| |v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8| |v_thread1Thread1of1ForFork2_minus_#in~a#1_In_3|) (let ((.cse1 (not .cse5)) (.cse6 (not .cse7))) (let ((.cse0 (= (ite .cse1 1 0) (ite .cse6 1 0)))) (or (and (not .cse0) (= (+ v_~result_6~0_Out_28 1) 0) .cse1 .cse2 .cse3) (and (or .cse1 .cse4) .cse0 (= v_~result_6~0_Out_28 0) .cse2 .cse3) (and .cse5 .cse6 (= v_~result_6~0_Out_28 1) .cse2 .cse3))))) (and (= |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| v_~result_6~0_Out_28) (= v_~sort_label_2~0_In_14 |v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_26| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|) .cse5 .cse7 (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8| v_~sort_label_0~0_In_15) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8| |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14| |v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|) (<= 0 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| 2147483648)) (= |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12| (+ |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_Out_12| (+ 2147483647 |v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|) (not .cse4) (<= |v_thread1Thread1of1ForFork2_minus_#res#1_Out_18| 2147483647) .cse2 .cse3))) InVars {~sort_label_0~0=v_~sort_label_0~0_In_15, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_In_4|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_In_3|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_In_8|, ~sort_label_2~0=v_~sort_label_2~0_In_14, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_5|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_In_8|, ~sort_label_is_null_3~0=v_~sort_label_is_null_3~0_In_14, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3|, ~sort_label_is_null_1~0=v_~sort_label_is_null_1~0_In_13} OutVars{~sort_label_0~0=v_~sort_label_0~0_In_15, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_Out_24|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_Out_32|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_Out_8|, ~sort_label_2~0=v_~sort_label_2~0_In_14, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_Out_18|, ~sort_label_is_null_3~0=v_~sort_label_is_null_3~0_In_14, ~result_6~0=v_~result_6~0_Out_28, ~sort_label_is_null_1~0=v_~sort_label_is_null_1~0_In_13, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_Out_8|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_Out_14|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_Out_22|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_18|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_Out_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_22|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_Out_12|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_22|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_minus_#res#1, ~result_6~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [838] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_20| 0)) (.cse5 (= (mod v_~sort_label_is_null_1~0_In_11 256) 0)) (.cse6 (= v_~sort_label_0~0_In_13 v_~sort_label_4~0_In_16)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_20| 0)) (.cse7 (= (mod v_~sort_label_is_null_5~0_In_15 256) 0))) (or (and (let ((.cse2 (not .cse5)) (.cse4 (not .cse7))) (let ((.cse1 (= (ite .cse2 1 0) (ite .cse4 1 0)))) (or (and .cse0 (not .cse1) .cse2 (= (+ v_~result_7~0_Out_20 1) 0) .cse3) (and (= v_~result_7~0_Out_20 1) .cse0 .cse4 .cse5 .cse3) (and .cse0 (or .cse6 .cse2) .cse1 .cse3 (= v_~result_7~0_Out_20 0))))) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_Out_12| |v_thread2Thread1of1ForFork0_minus_#in~b#1_In_5|) (= |v_thread2Thread1of1ForFork0_minus_#res#1_Out_18| |v_thread2Thread1of1ForFork0_minus_#res#1_In_3|) (= |v_thread2Thread1of1ForFork0_minus_~a#1_Out_10| |v_thread2Thread1of1ForFork0_minus_~a#1_In_6|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_3|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_16| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_4|) (= |v_thread2Thread1of1ForFork0_minus_~b#1_In_6| |v_thread2Thread1of1ForFork0_minus_~b#1_Out_12|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_Out_12| |v_thread2Thread1of1ForFork0_minus_#in~a#1_In_4|)) (and (= |v_thread2Thread1of1ForFork0_minus_~a#1_Out_10| (+ |v_thread2Thread1of1ForFork0_minus_#res#1_Out_18| |v_thread2Thread1of1ForFork0_minus_~b#1_Out_12|)) (= v_~result_7~0_Out_20 |v_thread2Thread1of1ForFork0_minus_#res#1_Out_18|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_Out_12| |v_thread2Thread1of1ForFork0_minus_~b#1_Out_12|) .cse0 (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_Out_12| v_~sort_label_0~0_In_13) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_Out_12| v_~sort_label_4~0_In_16) .cse5 (not .cse6) (<= |v_thread2Thread1of1ForFork0_minus_#res#1_Out_18| 2147483647) (= |v_thread2Thread1of1ForFork0_minus_~a#1_Out_10| |v_thread2Thread1of1ForFork0_minus_#in~a#1_Out_12|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_16| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24|) (<= 0 (+ |v_thread2Thread1of1ForFork0_minus_#res#1_Out_18| 2147483648)) .cse3 .cse7 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_16| (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~a#1_Out_10| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_Out_12|)) (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_Out_12|)) 1 0))))) InVars {~sort_label_0~0=v_~sort_label_0~0_In_13, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_In_6|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_3|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_In_6|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_In_4|, ~sort_label_4~0=v_~sort_label_4~0_In_16, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_In_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_4|, ~sort_label_is_null_5~0=v_~sort_label_is_null_5~0_In_15, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_In_5|, ~sort_label_is_null_1~0=v_~sort_label_is_null_1~0_In_11} OutVars{~sort_label_0~0=v_~sort_label_0~0_In_13, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_Out_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_20|, ~sort_label_4~0=v_~sort_label_4~0_In_16, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_Out_18|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_16|, ~sort_label_is_null_5~0=v_~sort_label_is_null_5~0_In_15, ~result_7~0=v_~result_7~0_Out_20, thread2Thread1of1ForFork0_#t~ret5#1=|v_thread2Thread1of1ForFork0_#t~ret5#1_Out_18|, thread2Thread1of1ForFork0_#t~ite7#1=|v_thread2Thread1of1ForFork0_#t~ite7#1_Out_28|, ~sort_label_is_null_1~0=v_~sort_label_is_null_1~0_In_11, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_Out_10|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_24|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_20|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_Out_12|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_Out_12|, thread2Thread1of1ForFork0_#t~ite6#1=|v_thread2Thread1of1ForFork0_#t~ite6#1_Out_26|, thread2Thread1of1ForFork0_#t~ite8#1=|v_thread2Thread1of1ForFork0_#t~ite8#1_Out_28|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~result_7~0, thread2Thread1of1ForFork0_#t~ret5#1, thread2Thread1of1ForFork0_#t~ite7#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ite6#1, thread2Thread1of1ForFork0_#t~ite8#1] [2022-12-06 05:06:03,059 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:03,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 773 [2022-12-06 05:06:03,061 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 116 flow [2022-12-06 05:06:03,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:06:03,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:03,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:03,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:06:03,061 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:06:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash 613097009, now seen corresponding path program 1 times [2022-12-06 05:06:03,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:03,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85637263] [2022-12-06 05:06:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:03,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:04,461 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:06:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:04,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85637263] [2022-12-06 05:06:04,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85637263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:04,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:04,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:06:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798800252] [2022-12-06 05:06:04,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:06:04,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:06:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:06:04,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:06:04,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 116 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06:04,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:04,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:06:04,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:04,640 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-06 05:06:04,641 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-06 05:06:04,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 99 events. 31/99 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 318 event pairs, 6 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 324. Up to 61 conditions per place. [2022-12-06 05:06:04,642 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 25 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2022-12-06 05:06:04,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 222 flow [2022-12-06 05:06:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:06:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:06:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 05:06:04,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 05:06:04,643 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 116 flow. Second operand 5 states and 38 transitions. [2022-12-06 05:06:04,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 222 flow [2022-12-06 05:06:04,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 209 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:06:04,646 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 77 flow [2022-12-06 05:06:04,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2022-12-06 05:06:04,647 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-06 05:06:04,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:04,647 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 77 flow [2022-12-06 05:06:04,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:04,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:04,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 77 flow [2022-12-06 05:06:04,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 77 flow [2022-12-06 05:06:04,654 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 05:06:04,654 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:06:04,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 29 events. 0/29 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 05:06:04,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 77 flow [2022-12-06 05:06:04,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 05:06:04,655 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:04,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 05:06:04,656 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 77 flow [2022-12-06 05:06:04,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06:04,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:04,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:04,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:06:04,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:06:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash -703037709, now seen corresponding path program 3 times [2022-12-06 05:06:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:04,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193531309] [2022-12-06 05:06:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:05,856 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:06:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:05,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193531309] [2022-12-06 05:06:05,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193531309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:05,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:05,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:06:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611864991] [2022-12-06 05:06:05,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:05,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:06:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:06:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:06:05,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:06:05,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 77 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:06:05,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:05,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:06:05,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:06,160 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-06 05:06:06,160 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-06 05:06:06,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 84 events. 28/84 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 242 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 278. Up to 37 conditions per place. [2022-12-06 05:06:06,161 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-06 05:06:06,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 215 flow [2022-12-06 05:06:06,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:06:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:06:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-06 05:06:06,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:06:06,162 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 77 flow. Second operand 6 states and 40 transitions. [2022-12-06 05:06:06,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 215 flow [2022-12-06 05:06:06,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 199 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:06:06,164 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 62 flow [2022-12-06 05:06:06,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-06 05:06:06,165 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 05:06:06,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:06,165 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 62 flow [2022-12-06 05:06:06,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:06,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:06,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 62 flow [2022-12-06 05:06:06,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 62 flow [2022-12-06 05:06:06,171 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 05:06:06,171 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:06:06,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 16 events. 0/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 05:06:06,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 62 flow [2022-12-06 05:06:06,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 05:06:06,172 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:06,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 05:06:06,173 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 62 flow [2022-12-06 05:06:06,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:06:06,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:06,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:06,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:06:06,173 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:06:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash 83543457, now seen corresponding path program 4 times [2022-12-06 05:06:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:06,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972732766] [2022-12-06 05:06:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:06,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:07,896 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:06:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:07,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972732766] [2022-12-06 05:06:07,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972732766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:07,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:07,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:06:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846757624] [2022-12-06 05:06:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:07,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:06:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:06:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:06:07,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:06:07,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 16 transitions, 62 flow. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:06:07,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:07,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:06:07,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:08,325 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-06 05:06:08,325 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 05:06:08,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 37 events. 11/37 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2022-12-06 05:06:08,326 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-06 05:06:08,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 136 flow [2022-12-06 05:06:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:06:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:06:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-06 05:06:08,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-06 05:06:08,327 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 62 flow. Second operand 6 states and 27 transitions. [2022-12-06 05:06:08,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 136 flow [2022-12-06 05:06:08,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 124 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:06:08,328 INFO L231 Difference]: Finished difference. Result has 31 places, 0 transitions, 0 flow [2022-12-06 05:06:08,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=31, PETRI_TRANSITIONS=0} [2022-12-06 05:06:08,329 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-06 05:06:08,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:08,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 0 transitions, 0 flow [2022-12-06 05:06:08,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:06:08,329 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:06:08,329 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:06:08,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:06:08,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:06:08,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:06:08,335 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:08,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 05:06:08,336 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:06:08,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:06:08,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:06:08,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:06:08,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:06:08,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:06:08,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:06:08,339 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-06 05:06:08,342 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:06:08,342 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:06:08,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:06:08 BasicIcfg [2022-12-06 05:06:08,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:06:08,345 INFO L158 Benchmark]: Toolchain (without parser) took 20882.72ms. Allocated memory was 175.1MB in the beginning and 443.5MB in the end (delta: 268.4MB). Free memory was 151.3MB in the beginning and 412.4MB in the end (delta: -261.1MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-12-06 05:06:08,345 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:06:08,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.44ms. Allocated memory is still 175.1MB. Free memory was 150.9MB in the beginning and 139.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:06:08,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.13ms. Allocated memory is still 175.1MB. Free memory was 139.8MB in the beginning and 137.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:06:08,346 INFO L158 Benchmark]: Boogie Preprocessor took 30.83ms. Allocated memory is still 175.1MB. Free memory was 137.3MB in the beginning and 135.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:06:08,346 INFO L158 Benchmark]: RCFGBuilder took 569.52ms. Allocated memory is still 175.1MB. Free memory was 135.6MB in the beginning and 116.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 05:06:08,347 INFO L158 Benchmark]: TraceAbstraction took 19914.07ms. Allocated memory was 175.1MB in the beginning and 443.5MB in the end (delta: 268.4MB). Free memory was 116.3MB in the beginning and 412.4MB in the end (delta: -296.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:06:08,348 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.12ms. Allocated memory is still 175.1MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.44ms. Allocated memory is still 175.1MB. Free memory was 150.9MB in the beginning and 139.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.13ms. Allocated memory is still 175.1MB. Free memory was 139.8MB in the beginning and 137.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.83ms. Allocated memory is still 175.1MB. Free memory was 137.3MB in the beginning and 135.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 569.52ms. Allocated memory is still 175.1MB. Free memory was 135.6MB in the beginning and 116.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 19914.07ms. Allocated memory was 175.1MB in the beginning and 443.5MB in the end (delta: 268.4MB). Free memory was 116.3MB in the beginning and 412.4MB in the end (delta: -296.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 187 PlacesBefore, 26 PlacesAfterwards, 194 TransitionsBefore, 16 TransitionsAfterwards, 11934 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 50 TrivialYvCompositions, 111 ConcurrentYvCompositions, 14 ChoiceCompositions, 175 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8282, independent: 8282, independent conditional: 8282, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8282, independent: 8282, independent conditional: 0, independent unconditional: 8282, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8282, independent: 8282, independent conditional: 0, independent unconditional: 8282, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8282, independent: 8282, independent conditional: 0, independent unconditional: 8282, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7007, independent: 7007, independent conditional: 0, independent unconditional: 7007, 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: 7007, independent: 7007, independent conditional: 0, independent unconditional: 7007, 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: 8282, independent: 1275, independent conditional: 0, independent unconditional: 1275, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7007, unknown conditional: 0, unknown unconditional: 7007] , Statistics on independence cache: Total cache size (in pairs): 15532, Positive cache size: 15532, Positive conditional cache size: 0, Positive unconditional cache size: 15532, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 0.8s, 28 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 1, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 34 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 6, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 34 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 6, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 6, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 6, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 81]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 299 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404 IncrementalHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=2, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 3499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:06:08,369 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...