/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:05:23,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:05:23,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:05:23,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:05:23,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:05:23,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:05:23,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:05:23,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:05:23,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:05:23,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:05:23,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:05:23,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:05:23,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:05:23,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:05:23,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:05:23,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:05:23,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:05:23,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:05:23,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:05:23,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:05:23,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:05:23,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:05:23,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:05:23,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:05:23,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:05:24,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:05:24,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:05:24,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:05:24,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:05:24,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:05:24,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:05:24,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:05:24,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:05:24,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:05:24,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:05:24,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:05:24,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:05:24,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:05:24,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:05:24,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:05:24,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:05:24,010 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-RepeatedSemanticLbe.epf [2022-12-13 02:05:24,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:05:24,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:05:24,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:05:24,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:05:24,032 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:05:24,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:05:24,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:05:24,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:05:24,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:05:24,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:05:24,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:05:24,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:05:24,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:05:24,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:05:24,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:05:24,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:05:24,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:05:24,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:05:24,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:05:24,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:05:24,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:05:24,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:05:24,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:05:24,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:05:24,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:05:24,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:05:24,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:05:24,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:05:24,036 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-13 02:05:24,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:05:24,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:05:24,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:05:24,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:05:24,333 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:05:24,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-13 02:05:25,494 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:05:25,642 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:05:25,642 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-13 02:05:25,648 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b192db9f6/19c567ef3d86447b8a32f4f58e17e508/FLAG6728145fa [2022-12-13 02:05:25,659 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b192db9f6/19c567ef3d86447b8a32f4f58e17e508 [2022-12-13 02:05:25,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:05:25,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:05:25,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:05:25,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:05:25,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:05:25,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:25,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e01ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25, skipping insertion in model container [2022-12-13 02:05:25,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:25,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:05:25,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:05:25,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:05:25,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:05:25,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:05:25,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:05:25,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:05:25,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:05:25,897 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-13 02:05:25,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:05:25,926 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:05:25,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:05:25,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:05:25,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:05:25,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:05:25,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:05:25,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:05:25,964 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-13 02:05:25,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:05:25,990 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:05:25,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25 WrapperNode [2022-12-13 02:05:25,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:05:25,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:05:25,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:05:25,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:05:26,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,047 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2022-12-13 02:05:26,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:05:26,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:05:26,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:05:26,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:05:26,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,084 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:05:26,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:05:26,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:05:26,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:05:26,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (1/1) ... [2022-12-13 02:05:26,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:05:26,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:05:26,132 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-13 02:05:26,159 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-13 02:05:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:05:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:05:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:05:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:05:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:05:26,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:05:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:05:26,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:05:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 02:05:26,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 02:05:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:05:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 02:05:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 02:05:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:05:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:05:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:05:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:05:26,180 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 02:05:26,332 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:05:26,334 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:05:26,598 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:05:26,790 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:05:26,791 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 02:05:26,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:05:26 BoogieIcfgContainer [2022-12-13 02:05:26,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:05:26,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:05:26,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:05:26,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:05:26,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:05:25" (1/3) ... [2022-12-13 02:05:26,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef41a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:05:26, skipping insertion in model container [2022-12-13 02:05:26,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:05:25" (2/3) ... [2022-12-13 02:05:26,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef41a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:05:26, skipping insertion in model container [2022-12-13 02:05:26,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:05:26" (3/3) ... [2022-12-13 02:05:26,800 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-12-13 02:05:26,813 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:05:26,813 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:05:26,813 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:05:26,872 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 02:05:26,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-13 02:05:26,955 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-13 02:05:26,956 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:05:26,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 02:05:26,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-13 02:05:26,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-13 02:05:26,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:26,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-13 02:05:26,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 274 flow [2022-12-13 02:05:27,015 INFO L130 PetriNetUnfolder]: 12/128 cut-off events. [2022-12-13 02:05:27,016 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:05:27,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 12/128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 02:05:27,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-13 02:05:27,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 02:05:32,003 INFO L241 LiptonReduction]: Total number of compositions: 104 [2022-12-13 02:05:32,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:05:32,031 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;@680fe3ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:05:32,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 02:05:32,037 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-13 02:05:32,038 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:05:32,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:32,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:32,039 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-13 02:05:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash 192526010, now seen corresponding path program 1 times [2022-12-13 02:05:32,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:32,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430133674] [2022-12-13 02:05:32,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:32,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:32,492 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-13 02:05:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:32,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430133674] [2022-12-13 02:05:32,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430133674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:32,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:32,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 02:05:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089310007] [2022-12-13 02:05:32,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:32,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:05:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:05:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:05:32,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 02:05:32,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 02:05:32,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:32,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 02:05:32,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:32,686 INFO L130 PetriNetUnfolder]: 360/508 cut-off events. [2022-12-13 02:05:32,686 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 02:05:32,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 360/508 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1627 event pairs, 39 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-13 02:05:32,695 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2022-12-13 02:05:32,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2022-12-13 02:05:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:05:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:05:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 02:05:32,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2022-12-13 02:05:32,709 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-13 02:05:32,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2022-12-13 02:05:32,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 165 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 02:05:32,716 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2022-12-13 02:05:32,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2022-12-13 02:05:32,723 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-13 02:05:32,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:32,725 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 80 flow [2022-12-13 02:05:32,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:32,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:32,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-13 02:05:32,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 80 flow [2022-12-13 02:05:32,737 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][25], [Black: 144#(= ~res2~0 ~res1~0), 63#L92-2true, 142#true]) [2022-12-13 02:05:32,737 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 02:05:32,737 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 02:05:32,737 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 02:05:32,738 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 02:05:32,740 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-13 02:05:32,740 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:05:32,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 64 events. 23/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 64. Up to 26 conditions per place. [2022-12-13 02:05:32,743 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-13 02:05:32,743 INFO L226 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-13 02:05:32,744 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:05:32,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 02:05:32,753 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2022-12-13 02:05:32,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 02:05:32,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:32,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:05:32,758 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-13 02:05:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash -440998104, now seen corresponding path program 1 times [2022-12-13 02:05:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:32,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019108175] [2022-12-13 02:05:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:33,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:33,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019108175] [2022-12-13 02:05:33,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019108175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:33,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:33,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:05:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091773440] [2022-12-13 02:05:33,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:33,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:33,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:33,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:33,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 02:05:33,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 02:05:33,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:33,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 02:05:33,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:33,273 INFO L130 PetriNetUnfolder]: 665/977 cut-off events. [2022-12-13 02:05:33,273 INFO L131 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2022-12-13 02:05:33,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 977 events. 665/977 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4048 event pairs, 182 based on Foata normal form. 38/1003 useless extension candidates. Maximal degree in co-relation 488. Up to 368 conditions per place. [2022-12-13 02:05:33,279 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-13 02:05:33,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 71 transitions, 348 flow [2022-12-13 02:05:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:05:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:05:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 02:05:33,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-13 02:05:33,281 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 6 states and 73 transitions. [2022-12-13 02:05:33,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 71 transitions, 348 flow [2022-12-13 02:05:33,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:05:33,284 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 115 flow [2022-12-13 02:05:33,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-13 02:05:33,285 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-13 02:05:33,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:33,285 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 115 flow [2022-12-13 02:05:33,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:33,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:33,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-13 02:05:33,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 115 flow [2022-12-13 02:05:33,297 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][29], [Black: 144#(= ~res2~0 ~res1~0), 63#L92-2true, Black: 146#true, Black: 154#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 148#(or (not (<= ~M~0 ~N~0)) (not (<= 0 ~M~0)) (and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 152#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-13 02:05:33,298 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 02:05:33,298 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 02:05:33,298 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 02:05:33,298 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 02:05:33,298 INFO L130 PetriNetUnfolder]: 30/102 cut-off events. [2022-12-13 02:05:33,298 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-13 02:05:33,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 102 events. 30/102 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 338 event pairs, 1 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 107. Up to 35 conditions per place. [2022-12-13 02:05:33,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-13 02:05:33,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 02:05:35,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:35,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2297 [2022-12-13 02:05:35,582 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 121 flow [2022-12-13 02:05:35,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-13 02:05:35,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:35,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:35,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:05:35,583 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-13 02:05:35,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash 443967071, now seen corresponding path program 1 times [2022-12-13 02:05:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:35,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727918569] [2022-12-13 02:05:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:35,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727918569] [2022-12-13 02:05:35,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727918569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:35,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:35,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943514243] [2022-12-13 02:05:35,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:35,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:05:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:35,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:05:35,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:05:35,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 02:05:35,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-13 02:05:35,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:35,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 02:05:35,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:35,839 INFO L130 PetriNetUnfolder]: 489/763 cut-off events. [2022-12-13 02:05:35,839 INFO L131 PetriNetUnfolder]: For 404/430 co-relation queries the response was YES. [2022-12-13 02:05:35,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 763 events. 489/763 cut-off events. For 404/430 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3304 event pairs, 189 based on Foata normal form. 52/779 useless extension candidates. Maximal degree in co-relation 1361. Up to 485 conditions per place. [2022-12-13 02:05:35,845 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 51 selfloop transitions, 2 changer transitions 1/57 dead transitions. [2022-12-13 02:05:35,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 301 flow [2022-12-13 02:05:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:05:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:05:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-13 02:05:35,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-13 02:05:35,847 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 121 flow. Second operand 4 states and 58 transitions. [2022-12-13 02:05:35,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 301 flow [2022-12-13 02:05:35,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 295 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 02:05:35,850 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 122 flow [2022-12-13 02:05:35,850 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-13 02:05:35,851 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-13 02:05:35,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:35,851 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 122 flow [2022-12-13 02:05:35,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:35,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:35,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 122 flow [2022-12-13 02:05:35,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 122 flow [2022-12-13 02:05:35,862 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][29], [Black: 144#(= ~res2~0 ~res1~0), Black: 162#(<= ~N~0 0), Black: 163#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 63#L92-2true, 160#true, Black: 146#true, Black: 154#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 148#(or (not (<= ~M~0 ~N~0)) (not (<= 0 ~M~0)) (and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 152#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-13 02:05:35,862 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 02:05:35,863 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 02:05:35,863 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 02:05:35,863 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 02:05:35,863 INFO L130 PetriNetUnfolder]: 24/89 cut-off events. [2022-12-13 02:05:35,863 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-13 02:05:35,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 89 events. 24/89 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 1 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 121. Up to 29 conditions per place. [2022-12-13 02:05:35,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 122 flow [2022-12-13 02:05:35,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 02:05:35,865 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:05:35,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 02:05:35,866 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 122 flow [2022-12-13 02:05:35,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-13 02:05:35,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:35,867 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:35,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:05:35,867 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-13 02:05:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1262704552, now seen corresponding path program 1 times [2022-12-13 02:05:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:35,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956807183] [2022-12-13 02:05:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:35,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:35,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956807183] [2022-12-13 02:05:35,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956807183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:35,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:35,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723787731] [2022-12-13 02:05:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:35,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:05:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:05:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:05:35,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 02:05:35,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 02:05:35,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:35,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 02:05:35,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,115 INFO L130 PetriNetUnfolder]: 483/740 cut-off events. [2022-12-13 02:05:36,115 INFO L131 PetriNetUnfolder]: For 515/540 co-relation queries the response was YES. [2022-12-13 02:05:36,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 740 events. 483/740 cut-off events. For 515/540 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2892 event pairs, 248 based on Foata normal form. 47/784 useless extension candidates. Maximal degree in co-relation 1583. Up to 568 conditions per place. [2022-12-13 02:05:36,120 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 26 selfloop transitions, 0 changer transitions 26/53 dead transitions. [2022-12-13 02:05:36,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 282 flow [2022-12-13 02:05:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:05:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:05:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 02:05:36,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-13 02:05:36,121 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 122 flow. Second operand 4 states and 53 transitions. [2022-12-13 02:05:36,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 282 flow [2022-12-13 02:05:36,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 273 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 02:05:36,124 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 91 flow [2022-12-13 02:05:36,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-13 02:05:36,125 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-13 02:05:36,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,125 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 91 flow [2022-12-13 02:05:36,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 91 flow [2022-12-13 02:05:36,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 91 flow [2022-12-13 02:05:36,132 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][25], [Black: 144#(= ~res2~0 ~res1~0), Black: 162#(<= ~N~0 0), Black: 163#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 63#L92-2true, Black: 169#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), Black: 146#true, Black: 168#(<= ~M~0 0), Black: 154#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 152#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-13 02:05:36,132 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 02:05:36,133 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 02:05:36,133 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 02:05:36,133 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 02:05:36,134 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-13 02:05:36,134 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:05:36,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 64 events. 23/64 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 144 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 99. Up to 26 conditions per place. [2022-12-13 02:05:36,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 91 flow [2022-12-13 02:05:36,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-13 02:05:36,136 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:05:36,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 02:05:36,137 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 91 flow [2022-12-13 02:05:36,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 02:05:36,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:36,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:36,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:05:36,138 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-13 02:05:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash -555608095, now seen corresponding path program 1 times [2022-12-13 02:05:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:36,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429624277] [2022-12-13 02:05:36,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:36,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:05:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429624277] [2022-12-13 02:05:36,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429624277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:05:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844100134] [2022-12-13 02:05:36,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:05:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:05:36,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:05:36,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 02:05:36,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 91 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-13 02:05:36,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 02:05:36,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,476 INFO L130 PetriNetUnfolder]: 544/798 cut-off events. [2022-12-13 02:05:36,476 INFO L131 PetriNetUnfolder]: For 466/466 co-relation queries the response was YES. [2022-12-13 02:05:36,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 798 events. 544/798 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3069 event pairs, 139 based on Foata normal form. 16/811 useless extension candidates. Maximal degree in co-relation 2180. Up to 410 conditions per place. [2022-12-13 02:05:36,481 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 58 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-12-13 02:05:36,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 67 transitions, 361 flow [2022-12-13 02:05:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:05:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:05:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-13 02:05:36,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 02:05:36,483 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 91 flow. Second operand 6 states and 64 transitions. [2022-12-13 02:05:36,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 67 transitions, 361 flow [2022-12-13 02:05:36,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 67 transitions, 330 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-13 02:05:36,487 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 133 flow [2022-12-13 02:05:36,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-13 02:05:36,487 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-13 02:05:36,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,488 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 133 flow [2022-12-13 02:05:36,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-13 02:05:36,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 133 flow [2022-12-13 02:05:36,495 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][30], [182#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 144#(= ~res2~0 ~res1~0), 63#L92-2true, Black: 180#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 146#true, Black: 184#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-13 02:05:36,496 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 02:05:36,496 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 02:05:36,496 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 02:05:36,496 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 02:05:36,496 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][30], [Black: 144#(= ~res2~0 ~res1~0), 182#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 63#L92-2true, Black: 180#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 146#true, Black: 184#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-13 02:05:36,496 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 02:05:36,497 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 02:05:36,497 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 02:05:36,497 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 02:05:36,497 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 02:05:36,498 INFO L130 PetriNetUnfolder]: 29/84 cut-off events. [2022-12-13 02:05:36,498 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-13 02:05:36,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 84 events. 29/84 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 230 event pairs, 1 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 132. Up to 33 conditions per place. [2022-12-13 02:05:36,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-13 02:05:36,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 02:05:36,545 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:05:36,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 02:05:36,546 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 99 flow [2022-12-13 02:05:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-13 02:05:36,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:36,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:36,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:05:36,547 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:05:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash -181262365, now seen corresponding path program 1 times [2022-12-13 02:05:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973320406] [2022-12-13 02:05:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:05:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973320406] [2022-12-13 02:05:36,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973320406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:05:36,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117791306] [2022-12-13 02:05:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:36,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 02:05:36,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-13 02:05:36,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 02:05:36,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,770 INFO L130 PetriNetUnfolder]: 242/410 cut-off events. [2022-12-13 02:05:36,771 INFO L131 PetriNetUnfolder]: For 556/556 co-relation queries the response was YES. [2022-12-13 02:05:36,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 410 events. 242/410 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1582 event pairs, 81 based on Foata normal form. 12/419 useless extension candidates. Maximal degree in co-relation 476. Up to 246 conditions per place. [2022-12-13 02:05:36,773 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 39 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2022-12-13 02:05:36,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 249 flow [2022-12-13 02:05:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-13 02:05:36,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-13 02:05:36,775 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 99 flow. Second operand 5 states and 46 transitions. [2022-12-13 02:05:36,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 249 flow [2022-12-13 02:05:36,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 241 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 02:05:36,778 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 111 flow [2022-12-13 02:05:36,778 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-13 02:05:36,779 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-13 02:05:36,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,779 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 111 flow [2022-12-13 02:05:36,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 111 flow [2022-12-13 02:05:36,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 111 flow [2022-12-13 02:05:36,785 INFO L130 PetriNetUnfolder]: 7/45 cut-off events. [2022-12-13 02:05:36,786 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 02:05:36,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 45 events. 7/45 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 62. Up to 11 conditions per place. [2022-12-13 02:05:36,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 111 flow [2022-12-13 02:05:36,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-13 02:05:36,787 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:05:36,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 02:05:36,788 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 111 flow [2022-12-13 02:05:36,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-13 02:05:36,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:36,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:36,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:05:36,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:05:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1642832645, now seen corresponding path program 2 times [2022-12-13 02:05:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:36,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502529660] [2022-12-13 02:05:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:05:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502529660] [2022-12-13 02:05:36,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502529660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:05:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721751954] [2022-12-13 02:05:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:36,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 02:05:36,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-13 02:05:36,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 02:05:36,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,987 INFO L130 PetriNetUnfolder]: 202/335 cut-off events. [2022-12-13 02:05:36,987 INFO L131 PetriNetUnfolder]: For 542/542 co-relation queries the response was YES. [2022-12-13 02:05:36,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 335 events. 202/335 cut-off events. For 542/542 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1189 event pairs, 81 based on Foata normal form. 16/348 useless extension candidates. Maximal degree in co-relation 468. Up to 246 conditions per place. [2022-12-13 02:05:36,989 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 34 selfloop transitions, 7 changer transitions 1/43 dead transitions. [2022-12-13 02:05:36,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 258 flow [2022-12-13 02:05:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:36,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2022-12-13 02:05:36,990 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 111 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:36,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 258 flow [2022-12-13 02:05:36,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 227 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 02:05:36,992 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 116 flow [2022-12-13 02:05:36,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-13 02:05:36,993 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-13 02:05:36,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,993 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 116 flow [2022-12-13 02:05:36,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 116 flow [2022-12-13 02:05:36,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 116 flow [2022-12-13 02:05:37,000 INFO L130 PetriNetUnfolder]: 13/50 cut-off events. [2022-12-13 02:05:37,000 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-13 02:05:37,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 50 events. 13/50 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2022-12-13 02:05:37,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 116 flow [2022-12-13 02:05:37,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-13 02:05:37,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] L67-4-->L67-4: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread3Thread1of1ForFork2_plus_~b#1_17| |v_thread3Thread1of1ForFork2_plus_#in~b#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| v_~res2~0_101) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_17| v_~res2~0_102) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_93| v_~A~0.base_70) (+ v_~A~0.offset_70 (* |v_thread3Thread1of1ForFork2_~i~2#1_32| 4)))) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_#in~a#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| .cse0) (= (+ |v_thread3Thread1of1ForFork2_~i~2#1_32| 1) |v_thread3Thread1of1ForFork2_~i~2#1_31|) (< |v_thread3Thread1of1ForFork2_~i~2#1_32| v_~N~0_39) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483647))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, #memory_int=|v_#memory_int_93|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_32|, ~res2~0=v_~res2~0_102} OutVars{~A~0.base=v_~A~0.base_70, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_31|, ~A~0.offset=v_~A~0.offset_70, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_17|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_17|, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_17|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_17|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_17|, ~res2~0=v_~res2~0_101, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, thread3Thread1of1ForFork2_~i~2#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1] and [516] $Ultimate##0-->L67-4: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1] [2022-12-13 02:05:37,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] L67-4-->L67-4: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread3Thread1of1ForFork2_plus_~b#1_17| |v_thread3Thread1of1ForFork2_plus_#in~b#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| v_~res2~0_101) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_17| v_~res2~0_102) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_93| v_~A~0.base_70) (+ v_~A~0.offset_70 (* |v_thread3Thread1of1ForFork2_~i~2#1_32| 4)))) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_#in~a#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| .cse0) (= (+ |v_thread3Thread1of1ForFork2_~i~2#1_32| 1) |v_thread3Thread1of1ForFork2_~i~2#1_31|) (< |v_thread3Thread1of1ForFork2_~i~2#1_32| v_~N~0_39) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483647))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, #memory_int=|v_#memory_int_93|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_32|, ~res2~0=v_~res2~0_102} OutVars{~A~0.base=v_~A~0.base_70, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_31|, ~A~0.offset=v_~A~0.offset_70, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_17|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_17|, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_17|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_17|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_17|, ~res2~0=v_~res2~0_101, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, thread3Thread1of1ForFork2_~i~2#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1] and [516] $Ultimate##0-->L67-4: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1] [2022-12-13 02:05:37,187 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 02:05:37,188 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:37,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-13 02:05:37,188 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 122 flow [2022-12-13 02:05:37,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-13 02:05:37,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:37,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:37,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:05:37,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:05:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash -664573358, now seen corresponding path program 1 times [2022-12-13 02:05:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:37,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329179876] [2022-12-13 02:05:37,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:05:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:37,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329179876] [2022-12-13 02:05:37,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329179876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:37,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:37,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:37,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621720566] [2022-12-13 02:05:37,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:37,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:05:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:05:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:05:37,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 02:05:37,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 02:05:37,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:37,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 02:05:37,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:37,304 INFO L130 PetriNetUnfolder]: 110/199 cut-off events. [2022-12-13 02:05:37,304 INFO L131 PetriNetUnfolder]: For 284/312 co-relation queries the response was YES. [2022-12-13 02:05:37,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 199 events. 110/199 cut-off events. For 284/312 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 547 event pairs, 56 based on Foata normal form. 32/230 useless extension candidates. Maximal degree in co-relation 289. Up to 157 conditions per place. [2022-12-13 02:05:37,306 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 30 selfloop transitions, 4 changer transitions 2/37 dead transitions. [2022-12-13 02:05:37,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 225 flow [2022-12-13 02:05:37,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:05:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:05:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-13 02:05:37,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-13 02:05:37,307 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 122 flow. Second operand 4 states and 35 transitions. [2022-12-13 02:05:37,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 225 flow [2022-12-13 02:05:37,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 207 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:37,309 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 103 flow [2022-12-13 02:05:37,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-13 02:05:37,309 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-13 02:05:37,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:37,310 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 103 flow [2022-12-13 02:05:37,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:37,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:37,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 103 flow [2022-12-13 02:05:37,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 103 flow [2022-12-13 02:05:37,315 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-13 02:05:37,315 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-13 02:05:37,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 29 events. 6/29 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 43. Up to 9 conditions per place. [2022-12-13 02:05:37,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 103 flow [2022-12-13 02:05:37,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 02:05:37,318 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 02:05:37,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L67-4: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1] and [667] $Ultimate##0-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork1_~i~1#1_37| v_~M~0_69)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_37|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_11|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_11| 0)) InVars {~M~0=v_~M~0_69} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_11|, ~M~0=v_~M~0_69, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_11|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:37,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_39|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread3Thread1of1ForFork2_~i~2#1_55| v_~M~0_75) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_39| v_~M~0_75))) InVars {~M~0=v_~M~0_75} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, ~M~0=v_~M~0_75, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_39|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_55|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_~i~1#1, thread3Thread1of1ForFork2_~i~2#1] and [600] L67-4-->L67-4: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread3Thread1of1ForFork2_plus_~b#1_17| |v_thread3Thread1of1ForFork2_plus_#in~b#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| v_~res2~0_101) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_17| v_~res2~0_102) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_93| v_~A~0.base_70) (+ v_~A~0.offset_70 (* |v_thread3Thread1of1ForFork2_~i~2#1_32| 4)))) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_#in~a#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| .cse0) (= (+ |v_thread3Thread1of1ForFork2_~i~2#1_32| 1) |v_thread3Thread1of1ForFork2_~i~2#1_31|) (< |v_thread3Thread1of1ForFork2_~i~2#1_32| v_~N~0_39) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483647))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, #memory_int=|v_#memory_int_93|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_32|, ~res2~0=v_~res2~0_102} OutVars{~A~0.base=v_~A~0.base_70, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_31|, ~A~0.offset=v_~A~0.offset_70, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_17|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_17|, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_17|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_17|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_17|, ~res2~0=v_~res2~0_101, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, thread3Thread1of1ForFork2_~i~2#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1] [2022-12-13 02:05:37,486 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:05:37,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 02:05:37,488 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 93 flow [2022-12-13 02:05:37,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-13 02:05:37,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:37,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:37,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 02:05:37,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:05:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:37,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1152789900, now seen corresponding path program 1 times [2022-12-13 02:05:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:37,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827163301] [2022-12-13 02:05:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:38,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827163301] [2022-12-13 02:05:38,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827163301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:05:38,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619914318] [2022-12-13 02:05:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:38,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:05:38,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:05:38,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:05:38,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 02:05:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:38,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 02:05:38,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:05:38,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 02:05:38,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:05:38,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:05:38,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:05:38,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:05:38,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:05:38,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:05:38,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-12-13 02:05:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:38,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:05:39,346 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int)) (or (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216))) (<= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216))) (< (+ c_~res2~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 1)))) (< 0 ~M~0) (< ~M~0 0)))) is different from false [2022-12-13 02:05:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:39,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619914318] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:05:39,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:05:39,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-13 02:05:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062513383] [2022-12-13 02:05:39,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:05:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 02:05:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 02:05:39,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=424, Unknown=7, NotChecked=42, Total=552 [2022-12-13 02:05:39,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 02:05:39,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 93 flow. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 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-13 02:05:39,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:39,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 02:05:39,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:39,899 INFO L130 PetriNetUnfolder]: 51/111 cut-off events. [2022-12-13 02:05:39,899 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-13 02:05:39,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 111 events. 51/111 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 327 event pairs, 2 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 166. Up to 33 conditions per place. [2022-12-13 02:05:39,900 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2022-12-13 02:05:39,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 332 flow [2022-12-13 02:05:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:05:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:05:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 10 states and 51 transitions. [2022-12-13 02:05:39,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2318181818181818 [2022-12-13 02:05:39,901 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 93 flow. Second operand 10 states and 51 transitions. [2022-12-13 02:05:39,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 332 flow [2022-12-13 02:05:39,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 269 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-13 02:05:39,902 INFO L231 Difference]: Finished difference. Result has 32 places, 0 transitions, 0 flow [2022-12-13 02:05:39,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=32, PETRI_TRANSITIONS=0} [2022-12-13 02:05:39,903 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-13 02:05:39,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:39,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 0 transitions, 0 flow [2022-12-13 02:05:39,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 02:05:39,904 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 02:05:39,904 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:05:39,904 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-13 02:05:39,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 02:05:39,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 02:05:39,904 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:05:39,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 02:05:39,905 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 02:05:39,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 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-13 02:05:39,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 02:05:39,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 02:05:39,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 02:05:39,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 02:05:39,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 02:05:40,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:05:40,108 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:40,111 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:05:40,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:05:40,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:05:40 BasicIcfg [2022-12-13 02:05:40,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:05:40,114 INFO L158 Benchmark]: Toolchain (without parser) took 14451.57ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 161.4MB in the beginning and 152.6MB in the end (delta: 8.8MB). Peak memory consumption was 153.2MB. Max. memory is 8.0GB. [2022-12-13 02:05:40,114 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 195.0MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:05:40,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.26ms. Allocated memory is still 195.0MB. Free memory was 160.9MB in the beginning and 148.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 02:05:40,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.90ms. Allocated memory is still 195.0MB. Free memory was 148.8MB in the beginning and 146.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:05:40,119 INFO L158 Benchmark]: Boogie Preprocessor took 50.29ms. Allocated memory is still 195.0MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:05:40,119 INFO L158 Benchmark]: RCFGBuilder took 692.81ms. Allocated memory is still 195.0MB. Free memory was 144.7MB in the beginning and 113.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 02:05:40,119 INFO L158 Benchmark]: TraceAbstraction took 13318.95ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 112.1MB in the beginning and 152.6MB in the end (delta: -40.4MB). Peak memory consumption was 103.9MB. Max. memory is 8.0GB. [2022-12-13 02:05:40,121 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.38ms. Allocated memory is still 195.0MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 327.26ms. Allocated memory is still 195.0MB. Free memory was 160.9MB in the beginning and 148.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.90ms. Allocated memory is still 195.0MB. Free memory was 148.8MB in the beginning and 146.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.29ms. Allocated memory is still 195.0MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 692.81ms. Allocated memory is still 195.0MB. Free memory was 144.7MB in the beginning and 113.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13318.95ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 112.1MB in the beginning and 152.6MB in the end (delta: -40.4MB). Peak memory consumption was 103.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 126 PlacesBefore, 30 PlacesAfterwards, 128 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 673, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 680, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 680, unknown conditional: 0, unknown unconditional: 680] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1057, Positive conditional cache size: 0, Positive unconditional cache size: 1057, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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, 27 PlacesBefore, 27 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: 2.3s, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 254 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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, 36 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 27 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, 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: 57, independent: 57, independent conditional: 57, 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: 57, independent: 57, independent conditional: 36, independent unconditional: 21, 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: 57, independent: 57, independent conditional: 36, independent unconditional: 21, 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: 32, independent: 32, independent conditional: 18, independent unconditional: 14, 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: 32, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 57, independent: 25, independent conditional: 18, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 32, unknown conditional: 18, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 18, Positive unconditional cache size: 14, 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: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 154 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): 32, Positive cache size: 32, Positive conditional cache size: 18, Positive unconditional cache size: 14, 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.2s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 6, independent unconditional: 8, 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: 14, independent: 14, independent conditional: 6, independent unconditional: 8, 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: 2, independent unconditional: 4, 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: 14, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 20, Positive unconditional cache size: 18, 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: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 22, independent unconditional: 10, 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: 32, independent: 32, independent conditional: 6, independent unconditional: 26, 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: 32, independent: 32, independent conditional: 6, independent unconditional: 26, 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: 19, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 13, independent conditional: 4, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 2, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 58, Positive conditional cache size: 22, Positive unconditional cache size: 36, 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: 16, Maximal queried relation: 0 - 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): 58, Positive cache size: 58, Positive conditional cache size: 22, Positive unconditional cache size: 36, 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: 95]: 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, 160 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: 13.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 371 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 933 IncrementalHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 10 mSDtfsCounter, 933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=5, InterpolantAutomatonStates: 47, 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.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 211 ConstructedInterpolants, 7 QuantifiedInterpolants, 1984 SizeOfPredicates, 28 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 7/13 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-13 02:05:40,153 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...