/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-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:10:24,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:10:24,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:10:24,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:10:24,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:10:24,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:10:24,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:10:24,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:10:24,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:10:24,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:10:24,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:10:24,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:10:24,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:10:24,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:10:24,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:10:24,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:10:24,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:10:24,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:10:24,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:10:24,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:10:24,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:10:24,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:10:24,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:10:24,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:10:24,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:10:24,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:10:24,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:10:24,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:10:24,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:10:24,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:10:24,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:10:24,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:10:24,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:10:24,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:10:24,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:10:24,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:10:24,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:10:24,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:10:24,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:10:24,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:10:24,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:10:24,939 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-06 00:10:24,971 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:10:24,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:10:24,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:10:24,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:10:24,973 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:10:24,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:10:24,973 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:10:24,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:10:24,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:10:24,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:10:24,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:10:24,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:10:24,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:10:24,974 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:10:24,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:10:24,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:10:24,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:10:24,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:10:24,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:10:24,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:10:24,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:10:24,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:10:24,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:10:24,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:10:24,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:10:24,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:10:24,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:10:24,976 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:10:24,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:10:25,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:10:25,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:10:25,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:10:25,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:10:25,364 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:10:25,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-06 00:10:26,603 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:10:26,842 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:10:26,842 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-06 00:10:26,851 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256f7d082/ef9f582121ba47d09dda38217a4245dd/FLAG388f6b42c [2022-12-06 00:10:26,862 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256f7d082/ef9f582121ba47d09dda38217a4245dd [2022-12-06 00:10:26,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:10:26,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:10:26,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:10:26,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:10:26,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:10:26,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:10:26" (1/1) ... [2022-12-06 00:10:26,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:26, skipping insertion in model container [2022-12-06 00:10:26,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:10:26" (1/1) ... [2022-12-06 00:10:26,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:10:26,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:10:27,077 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-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-06 00:10:27,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:10:27,105 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:10:27,141 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-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-06 00:10:27,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:10:27,166 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:10:27,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27 WrapperNode [2022-12-06 00:10:27,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:10:27,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:10:27,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:10:27,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:10:27,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,236 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2022-12-06 00:10:27,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:10:27,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:10:27,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:10:27,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:10:27,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,283 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:10:27,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:10:27,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:10:27,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:10:27,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (1/1) ... [2022-12-06 00:10:27,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:10:27,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:27,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:10:27,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:10:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:10:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:10:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:10:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:10:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:10:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:10:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:10:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:10:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:10:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:10:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:10:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:10:27,373 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:10:27,489 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:10:27,491 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:10:27,884 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:10:27,894 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:10:27,894 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 00:10:27,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:10:27 BoogieIcfgContainer [2022-12-06 00:10:27,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:10:27,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:10:27,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:10:27,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:10:27,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:10:26" (1/3) ... [2022-12-06 00:10:27,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d11c1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:10:27, skipping insertion in model container [2022-12-06 00:10:27,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:10:27" (2/3) ... [2022-12-06 00:10:27,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d11c1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:10:27, skipping insertion in model container [2022-12-06 00:10:27,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:10:27" (3/3) ... [2022-12-06 00:10:27,903 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-12-06 00:10:27,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:10:27,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:10:27,920 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:10:28,040 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:10:28,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 317 transitions, 658 flow [2022-12-06 00:10:28,265 INFO L130 PetriNetUnfolder]: 29/314 cut-off events. [2022-12-06 00:10:28,265 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:10:28,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 314 events. 29/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 427 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-06 00:10:28,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 317 transitions, 658 flow [2022-12-06 00:10:28,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 304 transitions, 626 flow [2022-12-06 00:10:28,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:28,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 304 transitions, 626 flow [2022-12-06 00:10:28,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 304 transitions, 626 flow [2022-12-06 00:10:28,400 INFO L130 PetriNetUnfolder]: 29/304 cut-off events. [2022-12-06 00:10:28,400 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:10:28,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 304 events. 29/304 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 422 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-06 00:10:28,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 304 transitions, 626 flow [2022-12-06 00:10:28,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 12810 [2022-12-06 00:10:39,560 INFO L203 LiptonReduction]: Total number of compositions: 276 [2022-12-06 00:10:39,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:10:39,577 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;@b702f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:10:39,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:10:39,583 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 00:10:39,583 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:10:39,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:39,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:39,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1440705028, now seen corresponding path program 1 times [2022-12-06 00:10:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:39,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344850609] [2022-12-06 00:10:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:40,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344850609] [2022-12-06 00:10:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344850609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:40,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:40,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:10:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920189735] [2022-12-06 00:10:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:40,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:10:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:10:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:10:40,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 00:10:40,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:40,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 00:10:40,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:40,418 INFO L130 PetriNetUnfolder]: 362/512 cut-off events. [2022-12-06 00:10:40,419 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 00:10:40,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 512 events. 362/512 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1612 event pairs, 39 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-06 00:10:40,427 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2022-12-06 00:10:40,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 203 flow [2022-12-06 00:10:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:10:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:10:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 00:10:40,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 00:10:40,438 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 51 transitions. [2022-12-06 00:10:40,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 203 flow [2022-12-06 00:10:40,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 44 transitions, 181 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:10:40,445 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 88 flow [2022-12-06 00:10:40,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2022-12-06 00:10:40,449 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-12-06 00:10:40,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:40,450 INFO L89 Accepts]: Start accepts. Operand has 29 places, 31 transitions, 88 flow [2022-12-06 00:10:40,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:40,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:40,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 31 transitions, 88 flow [2022-12-06 00:10:40,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 31 transitions, 88 flow [2022-12-06 00:10:40,472 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] thread3EXIT-->L88-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|} AuxVars[] AssignedVars[][29], [Black: 303#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 14#L88-2true, 301#true]) [2022-12-06 00:10:40,472 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-06 00:10:40,472 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-06 00:10:40,472 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 00:10:40,473 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:10:40,474 INFO L130 PetriNetUnfolder]: 25/68 cut-off events. [2022-12-06 00:10:40,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:10:40,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 68 events. 25/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 1 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 64. Up to 26 conditions per place. [2022-12-06 00:10:40,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 31 transitions, 88 flow [2022-12-06 00:10:40,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:10:40,477 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:40,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 00:10:40,479 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 88 flow [2022-12-06 00:10:40,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:40,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:40,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:10:40,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 638595226, now seen corresponding path program 1 times [2022-12-06 00:10:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:40,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535465079] [2022-12-06 00:10:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:40,670 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-06 00:10:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535465079] [2022-12-06 00:10:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535465079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:40,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:40,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917696038] [2022-12-06 00:10:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:40,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:10:40,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 00:10:40,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:40,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 00:10:40,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:40,913 INFO L130 PetriNetUnfolder]: 669/987 cut-off events. [2022-12-06 00:10:40,913 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-06 00:10:40,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 987 events. 669/987 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4015 event pairs, 243 based on Foata normal form. 38/1009 useless extension candidates. Maximal degree in co-relation 500. Up to 518 conditions per place. [2022-12-06 00:10:40,920 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 60 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2022-12-06 00:10:40,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 72 transitions, 340 flow [2022-12-06 00:10:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 00:10:40,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-06 00:10:40,923 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 88 flow. Second operand 5 states and 74 transitions. [2022-12-06 00:10:40,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 72 transitions, 340 flow [2022-12-06 00:10:40,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 72 transitions, 332 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:10:40,927 INFO L231 Difference]: Finished difference. Result has 35 places, 39 transitions, 150 flow [2022-12-06 00:10:40,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=35, PETRI_TRANSITIONS=39} [2022-12-06 00:10:40,928 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-06 00:10:40,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:40,928 INFO L89 Accepts]: Start accepts. Operand has 35 places, 39 transitions, 150 flow [2022-12-06 00:10:40,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:40,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:40,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 39 transitions, 150 flow [2022-12-06 00:10:40,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 39 transitions, 150 flow [2022-12-06 00:10:40,944 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] thread3EXIT-->L88-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|} AuxVars[] AssignedVars[][37], [Black: 303#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 14#L88-2true, Black: 313#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), Black: 307#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 311#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), 305#true]) [2022-12-06 00:10:40,945 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-12-06 00:10:40,945 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-06 00:10:40,945 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 00:10:40,945 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-12-06 00:10:40,945 INFO L130 PetriNetUnfolder]: 36/114 cut-off events. [2022-12-06 00:10:40,945 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-06 00:10:40,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 114 events. 36/114 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 341 event pairs, 1 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 132. Up to 35 conditions per place. [2022-12-06 00:10:40,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 39 transitions, 150 flow [2022-12-06 00:10:40,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 00:10:40,948 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:40,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 00:10:40,950 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 39 transitions, 150 flow [2022-12-06 00:10:40,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:40,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:40,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:10:40,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1049221569, now seen corresponding path program 1 times [2022-12-06 00:10:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:40,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001001680] [2022-12-06 00:10:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:41,087 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-06 00:10:41,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:41,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001001680] [2022-12-06 00:10:41,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001001680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:41,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:41,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:41,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409505301] [2022-12-06 00:10:41,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:41,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:41,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:10:41,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 00:10:41,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 39 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:41,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:41,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 00:10:41,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:41,285 INFO L130 PetriNetUnfolder]: 489/770 cut-off events. [2022-12-06 00:10:41,285 INFO L131 PetriNetUnfolder]: For 305/331 co-relation queries the response was YES. [2022-12-06 00:10:41,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 770 events. 489/770 cut-off events. For 305/331 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3229 event pairs, 186 based on Foata normal form. 52/814 useless extension candidates. Maximal degree in co-relation 1234. Up to 480 conditions per place. [2022-12-06 00:10:41,290 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 56 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2022-12-06 00:10:41,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 69 transitions, 366 flow [2022-12-06 00:10:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 00:10:41,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 00:10:41,293 INFO L175 Difference]: Start difference. First operand has 35 places, 39 transitions, 150 flow. Second operand 5 states and 72 transitions. [2022-12-06 00:10:41,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 69 transitions, 366 flow [2022-12-06 00:10:41,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 69 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 00:10:41,298 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 183 flow [2022-12-06 00:10:41,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2022-12-06 00:10:41,299 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-06 00:10:41,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:41,299 INFO L89 Accepts]: Start accepts. Operand has 41 places, 40 transitions, 183 flow [2022-12-06 00:10:41,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:41,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:41,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 40 transitions, 183 flow [2022-12-06 00:10:41,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 183 flow [2022-12-06 00:10:41,313 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] thread3EXIT-->L88-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|} AuxVars[] AssignedVars[][38], [Black: 303#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), 317#true, Black: 323#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), Black: 325#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), 14#L88-2true, Black: 313#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), Black: 307#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 311#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), 305#true]) [2022-12-06 00:10:41,313 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-06 00:10:41,313 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 00:10:41,313 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-06 00:10:41,313 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 00:10:41,314 INFO L130 PetriNetUnfolder]: 30/106 cut-off events. [2022-12-06 00:10:41,314 INFO L131 PetriNetUnfolder]: For 15/16 co-relation queries the response was YES. [2022-12-06 00:10:41,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 106 events. 30/106 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 308 event pairs, 1 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 132. Up to 29 conditions per place. [2022-12-06 00:10:41,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 40 transitions, 183 flow [2022-12-06 00:10:41,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 00:10:41,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1221] L101-22-->L83-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_12|) (= v_~C~0.base_Out_10 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_24|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_12| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_23|)) (= (store |v_#memory_int_In_31| |v_ULTIMATE.start_main_~#t1~0#1.base_In_4| (store (select |v_#memory_int_In_31| |v_ULTIMATE.start_main_~#t1~0#1.base_In_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_4| |v_ULTIMATE.start_main_#t~pre17#1_Out_8|)) |v_#memory_int_Out_28|) (= |v_#pthreadsForks_Out_14| (+ |v_#pthreadsForks_In_7| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_12|) (= |v_#pthreadsForks_In_7| |v_ULTIMATE.start_main_#t~pre17#1_Out_8|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_24| v_~C~0.offset_Out_10)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_12|, #pthreadsForks=|v_#pthreadsForks_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_12|, #memory_int=|v_#memory_int_In_31|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_4|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_23|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_12|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_12|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_12|, ~C~0.base=v_~C~0.base_Out_10, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_24|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_4|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_12|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_8|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_24|, #pthreadsForks=|v_#pthreadsForks_Out_14|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_12|, #memory_int=|v_#memory_int_Out_28|, ~C~0.offset=v_~C~0.offset_Out_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ~C~0.base, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1] and [760] $Ultimate##0-->L50-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 00:10:41,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1240] L101-14-->L101-22: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| |v_ULTIMATE.start_create_fresh_int_array_~size#1_168|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_145| |v_ULTIMATE.start_create_fresh_int_array_~size#1_169|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_144| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69| v_~N~0_110) (= (select |v_#valid_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_195| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_168| 4294967296) 1073741823) 1 0)) (= v_~B~0.base_79 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_152|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_253| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_195| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_253|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_168|) 1 0) 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= v_~B~0.offset_79 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_152|) (= |v_#valid_176| (store |v_#valid_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (= (store |v_#length_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_168| 1073741824))) |v_#length_167|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_152|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_152|, #valid=|v_#valid_177|, #length=|v_#length_168|, ~N~0=v_~N~0_110, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_145|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_169|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet29#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet29#1_105|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_45|, ~B~0.base=v_~B~0.base_79, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~N~0=v_~N~0_110, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_144|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_92|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_168|, ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.offset_131|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_create_fresh_int_array_#t~post28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post28#1_89|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_69|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_45|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_253|, #valid=|v_#valid_176|, ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.base_131|, #length=|v_#length_167|, ~B~0.offset=v_~B~0.offset_79, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_195|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet29#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~B~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post28#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.base, #length, ~B~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [760] $Ultimate##0-->L50-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 00:10:41,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:41,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 00:10:41,550 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 191 flow [2022-12-06 00:10:41,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:41,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:41,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:41,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:10:41,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1888758092, now seen corresponding path program 1 times [2022-12-06 00:10:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:41,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561402202] [2022-12-06 00:10:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:41,674 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-06 00:10:41,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:41,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561402202] [2022-12-06 00:10:41,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561402202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:41,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:41,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935892719] [2022-12-06 00:10:41,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:41,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:10:41,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 00:10:41,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:41,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:41,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 00:10:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:41,862 INFO L130 PetriNetUnfolder]: 417/647 cut-off events. [2022-12-06 00:10:41,862 INFO L131 PetriNetUnfolder]: For 401/437 co-relation queries the response was YES. [2022-12-06 00:10:41,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 647 events. 417/647 cut-off events. For 401/437 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2491 event pairs, 202 based on Foata normal form. 49/681 useless extension candidates. Maximal degree in co-relation 1352. Up to 510 conditions per place. [2022-12-06 00:10:41,866 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 26 selfloop transitions, 6 changer transitions 29/63 dead transitions. [2022-12-06 00:10:41,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 347 flow [2022-12-06 00:10:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 00:10:41,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2022-12-06 00:10:41,869 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 191 flow. Second operand 5 states and 67 transitions. [2022-12-06 00:10:41,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 347 flow [2022-12-06 00:10:41,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 330 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 00:10:41,875 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 140 flow [2022-12-06 00:10:41,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-06 00:10:41,876 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2022-12-06 00:10:41,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:41,876 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 140 flow [2022-12-06 00:10:41,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:41,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:41,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 140 flow [2022-12-06 00:10:41,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 140 flow [2022-12-06 00:10:41,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] thread3EXIT-->L88-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#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~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|} AuxVars[] AssignedVars[][32], [Black: 303#(and (= ~asum~0 0) (= ~bsum~0 0) (= ~csum~0 0)), Black: 336#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 334#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), Black: 323#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), 14#L88-2true, Black: 325#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), 328#true, Black: 313#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), Black: 307#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 311#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0)), 305#true]) [2022-12-06 00:10:41,886 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-06 00:10:41,886 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 00:10:41,886 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-06 00:10:41,886 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 00:10:41,888 INFO L130 PetriNetUnfolder]: 25/71 cut-off events. [2022-12-06 00:10:41,888 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:10:41,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 71 events. 25/71 cut-off events. For 3/3 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/64 useless extension candidates. Maximal degree in co-relation 114. Up to 26 conditions per place. [2022-12-06 00:10:41,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 140 flow [2022-12-06 00:10:41,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:10:41,890 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:10:41,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 00:10:41,894 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 140 flow [2022-12-06 00:10:41,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:41,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:41,895 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:41,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:10:41,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -104355202, now seen corresponding path program 1 times [2022-12-06 00:10:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:41,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434595398] [2022-12-06 00:10:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:10:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:42,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434595398] [2022-12-06 00:10:42,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434595398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:42,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069664469] [2022-12-06 00:10:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:42,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:10:42,022 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-06 00:10:42,052 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-06 00:10:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:42,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:10:42,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:10:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:10:42,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:10:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:10:42,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069664469] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:10:42,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:10:42,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-06 00:10:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081924467] [2022-12-06 00:10:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:42,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:10:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:42,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:10:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:10:42,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 00:10:42,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:42,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:42,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 00:10:42,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:42,471 INFO L130 PetriNetUnfolder]: 398/570 cut-off events. [2022-12-06 00:10:42,471 INFO L131 PetriNetUnfolder]: For 258/258 co-relation queries the response was YES. [2022-12-06 00:10:42,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 570 events. 398/570 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1989 event pairs, 126 based on Foata normal form. 38/597 useless extension candidates. Maximal degree in co-relation 1444. Up to 433 conditions per place. [2022-12-06 00:10:42,476 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 39 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2022-12-06 00:10:42,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 268 flow [2022-12-06 00:10:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:10:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:10:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 00:10:42,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-06 00:10:42,477 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 140 flow. Second operand 5 states and 48 transitions. [2022-12-06 00:10:42,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 268 flow [2022-12-06 00:10:42,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 232 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-12-06 00:10:42,479 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 129 flow [2022-12-06 00:10:42,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2022-12-06 00:10:42,480 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-06 00:10:42,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:42,480 INFO L89 Accepts]: Start accepts. Operand has 35 places, 35 transitions, 129 flow [2022-12-06 00:10:42,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:42,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:42,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 35 transitions, 129 flow [2022-12-06 00:10:42,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 129 flow [2022-12-06 00:10:42,490 INFO L130 PetriNetUnfolder]: 24/68 cut-off events. [2022-12-06 00:10:42,490 INFO L131 PetriNetUnfolder]: For 3/5 co-relation queries the response was YES. [2022-12-06 00:10:42,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 68 events. 24/68 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 129 event pairs, 1 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 101. Up to 25 conditions per place. [2022-12-06 00:10:42,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 35 transitions, 129 flow [2022-12-06 00:10:42,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 00:10:43,710 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 00:10:43,711 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:10:43,711 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 00:10:43,721 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-06 00:10:43,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:10:43,918 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:10:43,920 INFO L158 Benchmark]: Toolchain (without parser) took 17054.59ms. Allocated memory was 184.5MB in the beginning and 330.3MB in the end (delta: 145.8MB). Free memory was 160.9MB in the beginning and 268.2MB in the end (delta: -107.3MB). Peak memory consumption was 201.0MB. Max. memory is 8.0GB. [2022-12-06 00:10:43,920 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:10:43,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.52ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 149.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 00:10:43,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.49ms. Allocated memory is still 184.5MB. Free memory was 149.4MB in the beginning and 146.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:10:43,921 INFO L158 Benchmark]: Boogie Preprocessor took 49.82ms. Allocated memory is still 184.5MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:10:43,921 INFO L158 Benchmark]: RCFGBuilder took 596.22ms. Allocated memory is still 184.5MB. Free memory was 144.7MB in the beginning and 120.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 00:10:43,922 INFO L158 Benchmark]: TraceAbstraction took 16021.38ms. Allocated memory was 184.5MB in the beginning and 330.3MB in the end (delta: 145.8MB). Free memory was 119.5MB in the beginning and 268.2MB in the end (delta: -148.7MB). Peak memory consumption was 160.1MB. Max. memory is 8.0GB. [2022-12-06 00:10:43,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.52ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 149.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.49ms. Allocated memory is still 184.5MB. Free memory was 149.4MB in the beginning and 146.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.82ms. Allocated memory is still 184.5MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 596.22ms. Allocated memory is still 184.5MB. Free memory was 144.7MB in the beginning and 120.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16021.38ms. Allocated memory was 184.5MB in the beginning and 330.3MB in the end (delta: 145.8MB). Free memory was 119.5MB in the beginning and 268.2MB in the end (delta: -148.7MB). Peak memory consumption was 160.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 285 PlacesBefore, 32 PlacesAfterwards, 304 TransitionsBefore, 28 TransitionsAfterwards, 12810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 136 TrivialYvCompositions, 117 ConcurrentYvCompositions, 23 ChoiceCompositions, 276 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 7778, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7151, independent: 7138, independent conditional: 0, independent unconditional: 7138, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7151, independent: 7133, independent conditional: 0, independent unconditional: 7133, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7793, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 7151, unknown conditional: 0, unknown unconditional: 7151] , Statistics on independence cache: Total cache size (in pairs): 14092, Positive cache size: 14079, Positive conditional cache size: 0, Positive unconditional cache size: 14079, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 31 TransitionsBefore, 31 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, 35 PlacesBefore, 35 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 218 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.2s, 41 PlacesBefore, 41 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 8, independent unconditional: 14, 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: 22, independent: 22, independent conditional: 8, independent unconditional: 14, 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: 10, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 22, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 10, Positive conditional cache size: 3, Positive unconditional cache size: 7, 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: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 34 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): 10, Positive cache size: 10, Positive conditional cache size: 3, Positive unconditional cache size: 7, 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: 1.2s, 35 PlacesBefore, 34 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 12, independent unconditional: 14, 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: 26, independent: 26, independent conditional: 12, independent unconditional: 14, 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: 13, independent: 13, independent conditional: 6, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 26, independent: 13, independent conditional: 6, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 23, Positive conditional cache size: 9, 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: 14, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:10:43,945 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...