/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:06:10,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:06:10,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:06:10,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:06:10,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:06:10,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:06:10,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:06:10,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:06:10,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:06:10,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:06:10,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:06:10,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:06:10,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:06:10,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:06:10,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:06:10,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:06:10,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:06:10,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:06:10,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:06:10,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:06:10,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:06:10,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:06:10,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:06:10,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:06:10,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:06:10,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:06:10,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:06:10,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:06:10,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:06:10,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:06:10,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:06:10,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:06:10,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:06:10,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:06:10,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:06:10,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:06:10,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:06:10,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:06:10,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:06:10,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:06:10,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:06:10,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:06:10,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:06:10,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:06:10,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:06:10,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:06:10,772 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:06:10,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:06:10,772 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:06:10,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:06:10,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:06:10,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:06:10,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:06:10,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:06:10,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:06:10,774 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:06:10,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:06:10,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:06:10,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:06:10,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:06:10,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:06:10,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:06:10,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:06:10,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:06:10,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:06:10,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:06:10,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:06:10,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:06:10,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:06:10,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:06:10,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:06:11,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:06:11,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:06:11,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:06:11,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:06:11,110 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:06:11,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-12-06 05:06:12,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:06:12,383 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:06:12,383 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-12-06 05:06:12,389 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac4a544e/82884a59bceb4c31b22bb5d499f61b2d/FLAG773b544c3 [2022-12-06 05:06:12,400 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac4a544e/82884a59bceb4c31b22bb5d499f61b2d [2022-12-06 05:06:12,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:06:12,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:06:12,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:06:12,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:06:12,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:06:12,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba79021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12, skipping insertion in model container [2022-12-06 05:06:12,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:06:12,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:06:12,604 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-12-06 05:06:12,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:06:12,626 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:06:12,663 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-12-06 05:06:12,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:06:12,676 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:06:12,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12 WrapperNode [2022-12-06 05:06:12,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:06:12,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:06:12,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:06:12,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:06:12,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,737 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 193 [2022-12-06 05:06:12,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:06:12,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:06:12,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:06:12,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:06:12,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:06:12,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:06:12,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:06:12,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:06:12,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (1/1) ... [2022-12-06 05:06:12,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:06:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:06:12,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:06:12,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:06:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:06:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:06:12,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:06:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:06:12,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:06:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:06:12,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:06:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:06:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:06:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:06:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:06:12,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:06:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:06:12,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:06:12,858 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:06:13,022 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:06:13,023 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:06:13,295 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:06:13,310 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:06:13,311 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 05:06:13,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:06:13 BoogieIcfgContainer [2022-12-06 05:06:13,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:06:13,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:06:13,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:06:13,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:06:13,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:06:12" (1/3) ... [2022-12-06 05:06:13,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113d1f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:06:13, skipping insertion in model container [2022-12-06 05:06:13,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:06:12" (2/3) ... [2022-12-06 05:06:13,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113d1f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:06:13, skipping insertion in model container [2022-12-06 05:06:13,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:06:13" (3/3) ... [2022-12-06 05:06:13,323 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2022-12-06 05:06:13,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:06:13,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:06:13,342 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:06:13,512 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:06:13,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 225 transitions, 474 flow [2022-12-06 05:06:13,641 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-06 05:06:13,641 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:06:13,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 222 events. 19/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 498 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-12-06 05:06:13,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 225 transitions, 474 flow [2022-12-06 05:06:13,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 212 transitions, 442 flow [2022-12-06 05:06:13,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:13,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 212 transitions, 442 flow [2022-12-06 05:06:13,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 212 transitions, 442 flow [2022-12-06 05:06:13,757 INFO L130 PetriNetUnfolder]: 19/212 cut-off events. [2022-12-06 05:06:13,757 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:06:13,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 212 events. 19/212 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 504 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-12-06 05:06:13,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 212 transitions, 442 flow [2022-12-06 05:06:13,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 14784 [2022-12-06 05:06:21,626 INFO L203 LiptonReduction]: Total number of compositions: 190 [2022-12-06 05:06:21,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:06:21,646 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;@4f7b79b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:06:21,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:06:21,652 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 05:06:21,653 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:06:21,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:21,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:21,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:06:21,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 272799349, now seen corresponding path program 1 times [2022-12-06 05:06:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459705864] [2022-12-06 05:06:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:23,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459705864] [2022-12-06 05:06:23,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459705864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:23,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:23,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:06:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023509959] [2022-12-06 05:06:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:23,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:06:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:23,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:06:23,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:06:23,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:06:23,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:23,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:23,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:06:23,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:23,459 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-06 05:06:23,459 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 05:06:23,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 288 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-06 05:06:23,461 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-06 05:06:23,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-06 05:06:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:06:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:06:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 05:06:23,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 05:06:23,473 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 6 states and 46 transitions. [2022-12-06 05:06:23,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 228 flow [2022-12-06 05:06:23,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:06:23,481 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 71 flow [2022-12-06 05:06:23,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 05:06:23,487 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 05:06:23,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:23,488 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 71 flow [2022-12-06 05:06:23,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:23,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:23,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-06 05:06:23,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 71 flow [2022-12-06 05:06:23,507 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-06 05:06:23,507 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:06:23,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 2/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2022-12-06 05:06:23,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 71 flow [2022-12-06 05:06:23,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 05:06:23,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse5 (= (mod v_~filename_2~0_In_13 256) 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res#1.offset_Out_20| 0)) (.cse4 (= |v_thread3Thread1of1ForFork2_#res#1.base_Out_20| 0)) (.cse2 (= (mod v_~isNull_0~0_In_9 256) 0)) (.cse0 (= (mod v_~isNull_6~0_In_13 256) 0)) (.cse3 (= (mod v_~filename_8~0_In_17 256) 0))) (or (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_24|) .cse0 (<= 0 (+ |v_thread3Thread1of1ForFork2_minus_#res#1_Out_20| 2147483648)) .cse1 (= |v_thread3Thread1of1ForFork2_minus_~a#1_Out_14| |v_thread3Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= v_~filename_1~0_In_10 |v_thread3Thread1of1ForFork2_minus_#in~a#1_Out_10|) .cse2 .cse3 (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16| (ite (or (<= |v_thread3Thread1of1ForFork2_minus_~a#1_Out_14| (+ 2147483647 |v_thread3Thread1of1ForFork2_minus_~b#1_Out_14|)) (<= 0 |v_thread3Thread1of1ForFork2_minus_~b#1_Out_14|)) 1 0)) (= (+ |v_thread3Thread1of1ForFork2_minus_#res#1_Out_20| |v_thread3Thread1of1ForFork2_minus_~b#1_Out_14|) |v_thread3Thread1of1ForFork2_minus_~a#1_Out_14|) (= v_~filename_7~0_In_11 |v_thread3Thread1of1ForFork2_minus_#in~b#1_Out_10|) (= |v_thread3Thread1of1ForFork2_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork2_minus_#in~b#1_Out_10|) .cse4 (<= |v_thread3Thread1of1ForFork2_minus_#res#1_Out_20| 2147483647) .cse5 (= v_~result_11~0_Out_20 |v_thread3Thread1of1ForFork2_minus_#res#1_Out_20|)) (and (= |v_thread3Thread1of1ForFork2_minus_#in~a#1_In_5| |v_thread3Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= |v_thread3Thread1of1ForFork2_minus_~a#1_In_9| |v_thread3Thread1of1ForFork2_minus_~a#1_Out_14|) (= |v_thread3Thread1of1ForFork2_minus_#in~b#1_In_4| |v_thread3Thread1of1ForFork2_minus_#in~b#1_Out_10|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_6| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_24|) (= |v_thread3Thread1of1ForFork2_minus_#res#1_In_3| |v_thread3Thread1of1ForFork2_minus_#res#1_Out_20|) (let ((.cse8 (not .cse3)) (.cse6 (= (+ v_~result_11~0_Out_20 1) 0)) (.cse7 (not .cse0))) (or (and .cse1 .cse2 .cse4 .cse6 .cse7) (and (= (ite .cse8 0 1) v_~result_11~0_Out_20) .cse0 .cse1 .cse2 .cse4 (not .cse5)) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse6 .cse5) (and .cse1 .cse4 (not .cse2) (= v_~result_11~0_Out_20 (ite .cse7 0 1))))) (= |v_thread3Thread1of1ForFork2_minus_~b#1_In_9| |v_thread3Thread1of1ForFork2_minus_~b#1_Out_14|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_5|)))) InVars {thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_5|, thread3Thread1of1ForFork2_minus_#in~b#1=|v_thread3Thread1of1ForFork2_minus_#in~b#1_In_4|, ~filename_1~0=v_~filename_1~0_In_10, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_6|, ~filename_2~0=v_~filename_2~0_In_13, thread3Thread1of1ForFork2_minus_~a#1=|v_thread3Thread1of1ForFork2_minus_~a#1_In_9|, ~filename_7~0=v_~filename_7~0_In_11, thread3Thread1of1ForFork2_minus_#res#1=|v_thread3Thread1of1ForFork2_minus_#res#1_In_3|, ~filename_8~0=v_~filename_8~0_In_17, ~isNull_0~0=v_~isNull_0~0_In_9, ~isNull_6~0=v_~isNull_6~0_In_13, thread3Thread1of1ForFork2_minus_~b#1=|v_thread3Thread1of1ForFork2_minus_~b#1_In_9|, thread3Thread1of1ForFork2_minus_#in~a#1=|v_thread3Thread1of1ForFork2_minus_#in~a#1_In_5|} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|, thread3Thread1of1ForFork2_minus_#in~b#1=|v_thread3Thread1of1ForFork2_minus_#in~b#1_Out_10|, thread3Thread1of1ForFork2_#t~ite14#1=|v_thread3Thread1of1ForFork2_#t~ite14#1_Out_28|, ~filename_1~0=v_~filename_1~0_In_10, thread3Thread1of1ForFork2_#t~ite12#1=|v_thread3Thread1of1ForFork2_#t~ite12#1_Out_24|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_24|, ~filename_2~0=v_~filename_2~0_In_13, thread3Thread1of1ForFork2_minus_~a#1=|v_thread3Thread1of1ForFork2_minus_~a#1_Out_14|, ~filename_7~0=v_~filename_7~0_In_11, thread3Thread1of1ForFork2_#t~ite13#1=|v_thread3Thread1of1ForFork2_#t~ite13#1_Out_28|, thread3Thread1of1ForFork2_minus_#res#1=|v_thread3Thread1of1ForFork2_minus_#res#1_Out_20|, ~filename_8~0=v_~filename_8~0_In_17, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_Out_20|, ~isNull_0~0=v_~isNull_0~0_In_9, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_Out_20|, ~isNull_6~0=v_~isNull_6~0_In_13, thread3Thread1of1ForFork2_minus_~b#1=|v_thread3Thread1of1ForFork2_minus_~b#1_Out_14|, thread3Thread1of1ForFork2_#t~ite15#1=|v_thread3Thread1of1ForFork2_#t~ite15#1_Out_28|, ~result_11~0=v_~result_11~0_Out_20, thread3Thread1of1ForFork2_minus_#in~a#1=|v_thread3Thread1of1ForFork2_minus_#in~a#1_Out_10|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_Out_22|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_minus_#in~b#1, thread3Thread1of1ForFork2_#t~ite14#1, thread3Thread1of1ForFork2_#t~ite12#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_minus_~a#1, thread3Thread1of1ForFork2_#t~ite13#1, thread3Thread1of1ForFork2_minus_#res#1, thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_minus_~b#1, thread3Thread1of1ForFork2_#t~ite15#1, ~result_11~0, thread3Thread1of1ForFork2_minus_#in~a#1, thread3Thread1of1ForFork2_#t~ret11#1] and [922] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse3 (= (mod v_~isNull_0~0_In_11 256) 0)) (.cse5 (= (mod v_~isNull_3~0_In_13 256) 0)) (.cse0 (= 0 |v_thread1Thread1of1ForFork0_#res#1.offset_Out_26|)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_26| 0)) (.cse8 (= 0 (mod v_~filename_5~0_In_16 256))) (.cse7 (= (mod v_~filename_2~0_In_15 256) 0))) (or (and (= |v_thread1Thread1of1ForFork0_minus_~a#1_In_11| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12| |v_thread1Thread1of1ForFork0_minus_#in~b#1_In_7|) (let ((.cse1 (not .cse5)) (.cse4 (= (+ v_~result_9~0_Out_24 1) 0)) (.cse6 (not .cse8))) (or (and .cse0 (= v_~result_9~0_Out_24 (ite .cse1 0 1)) .cse2 (not .cse3)) (and .cse3 .cse0 .cse4 .cse2 .cse1) (and .cse3 .cse5 .cse0 .cse4 .cse2 .cse6 .cse7) (and .cse3 .cse5 .cse0 .cse2 (= v_~result_9~0_Out_24 (ite .cse6 0 1)) (not .cse7)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_28| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_5|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_In_11| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_In_5| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_8|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_In_6| |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12|)) (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) .cse3 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12| v_~filename_4~0_In_14) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_28|) .cse5 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|))) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|) .cse0 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|) .cse2 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12| v_~filename_1~0_In_12) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|)) .cse8 (= v_~result_9~0_Out_24 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|) .cse7))) InVars {thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_In_5|, ~filename_1~0=v_~filename_1~0_In_12, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_In_6|, ~filename_5~0=v_~filename_5~0_In_16, ~filename_2~0=v_~filename_2~0_In_15, ~filename_4~0=v_~filename_4~0_In_14, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_In_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_8|, ~isNull_3~0=v_~isNull_3~0_In_13, ~isNull_0~0=v_~isNull_0~0_In_11, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_In_11|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_In_11|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_5|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_Out_26|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_Out_32|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_26|, ~filename_1~0=v_~filename_1~0_In_12, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_Out_24|, ~filename_5~0=v_~filename_5~0_In_16, ~filename_2~0=v_~filename_2~0_In_15, ~result_9~0=v_~result_9~0_Out_24, ~filename_4~0=v_~filename_4~0_In_14, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, ~isNull_3~0=v_~isNull_3~0_In_13, ~isNull_0~0=v_~isNull_0~0_In_11, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_Out_26|, thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_Out_22|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_28|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ite4#1, ~result_9~0, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite5#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:06:24,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:24,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1198 [2022-12-06 05:06:24,685 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 78 flow [2022-12-06 05:06:24,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:24,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:24,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:24,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:06:24,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:06:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1039550609, now seen corresponding path program 2 times [2022-12-06 05:06:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:24,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819684659] [2022-12-06 05:06:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:25,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819684659] [2022-12-06 05:06:25,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819684659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:25,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:25,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:06:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716026622] [2022-12-06 05:06:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:25,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:06:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:25,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:06:25,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:06:25,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:06:25,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:25,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:25,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:06:25,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:25,803 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-06 05:06:25,803 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 05:06:25,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 431 event pairs, 6 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-06 05:06:25,804 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 10/47 dead transitions. [2022-12-06 05:06:25,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 244 flow [2022-12-06 05:06:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:06:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:06:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 05:06:25,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 05:06:25,806 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 78 flow. Second operand 6 states and 47 transitions. [2022-12-06 05:06:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 244 flow [2022-12-06 05:06:25,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 240 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:06:25,808 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 110 flow [2022-12-06 05:06:25,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 05:06:25,809 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 05:06:25,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:25,809 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 110 flow [2022-12-06 05:06:25,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:25,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:25,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 110 flow [2022-12-06 05:06:25,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 110 flow [2022-12-06 05:06:25,819 INFO L130 PetriNetUnfolder]: 1/42 cut-off events. [2022-12-06 05:06:25,819 INFO L131 PetriNetUnfolder]: For 40/44 co-relation queries the response was YES. [2022-12-06 05:06:25,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 42 events. 1/42 cut-off events. For 40/44 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2022-12-06 05:06:25,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 110 flow [2022-12-06 05:06:25,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:06:25,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [922] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse3 (= (mod v_~isNull_0~0_In_11 256) 0)) (.cse5 (= (mod v_~isNull_3~0_In_13 256) 0)) (.cse0 (= 0 |v_thread1Thread1of1ForFork0_#res#1.offset_Out_26|)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_26| 0)) (.cse8 (= 0 (mod v_~filename_5~0_In_16 256))) (.cse7 (= (mod v_~filename_2~0_In_15 256) 0))) (or (and (= |v_thread1Thread1of1ForFork0_minus_~a#1_In_11| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12| |v_thread1Thread1of1ForFork0_minus_#in~b#1_In_7|) (let ((.cse1 (not .cse5)) (.cse4 (= (+ v_~result_9~0_Out_24 1) 0)) (.cse6 (not .cse8))) (or (and .cse0 (= v_~result_9~0_Out_24 (ite .cse1 0 1)) .cse2 (not .cse3)) (and .cse3 .cse0 .cse4 .cse2 .cse1) (and .cse3 .cse5 .cse0 .cse4 .cse2 .cse6 .cse7) (and .cse3 .cse5 .cse0 .cse2 (= v_~result_9~0_Out_24 (ite .cse6 0 1)) (not .cse7)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_28| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_5|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_In_11| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_In_5| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_8|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_In_6| |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12|)) (and (<= |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) .cse3 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12| v_~filename_4~0_In_14) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_28|) .cse5 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|))) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|) .cse0 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_18| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|) .cse2 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12| v_~filename_1~0_In_12) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|)) .cse8 (= v_~result_9~0_Out_24 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|) .cse7))) InVars {thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_In_5|, ~filename_1~0=v_~filename_1~0_In_12, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_In_6|, ~filename_5~0=v_~filename_5~0_In_16, ~filename_2~0=v_~filename_2~0_In_15, ~filename_4~0=v_~filename_4~0_In_14, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_In_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_8|, ~isNull_3~0=v_~isNull_3~0_In_13, ~isNull_0~0=v_~isNull_0~0_In_11, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_In_11|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_In_11|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_5|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_Out_26|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_Out_32|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_26|, ~filename_1~0=v_~filename_1~0_In_12, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_12|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_Out_24|, ~filename_5~0=v_~filename_5~0_In_16, ~filename_2~0=v_~filename_2~0_In_15, ~result_9~0=v_~result_9~0_Out_24, ~filename_4~0=v_~filename_4~0_In_14, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_12|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, ~isNull_3~0=v_~isNull_3~0_In_13, ~isNull_0~0=v_~isNull_0~0_In_11, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_18|, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_Out_26|, thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_Out_22|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_16|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_28|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ite4#1, ~result_9~0, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite5#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [921] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse3 (= (mod v_~filename_5~0_In_14 256) 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_20| 0)) (.cse2 (= (mod v_~isNull_3~0_In_11 256) 0)) (.cse5 (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_20| 0)) (.cse0 (= (mod v_~isNull_6~0_In_15 256) 0)) (.cse4 (= (mod v_~filename_8~0_In_19 256) 0))) (or (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) .cse0 .cse1 (= v_~filename_7~0_In_13 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_14|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_14| v_~filename_4~0_In_12) .cse2 .cse3 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_14| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_14|) .cse4 .cse5 (= v_~result_10~0_Out_26 |v_thread2Thread1of1ForFork1_minus_#res#1_Out_28|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_14|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_14| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_14|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_14| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_14|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_Out_28| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_28| 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_28| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_14|) |v_thread2Thread1of1ForFork1_minus_~a#1_Out_14|)) (and (= |v_thread2Thread1of1ForFork1_minus_~a#1_In_13| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_14|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|) (= |v_thread2Thread1of1ForFork1_minus_#res#1_In_6| |v_thread2Thread1of1ForFork1_minus_#res#1_Out_28|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_14| |v_thread2Thread1of1ForFork1_minus_#in~a#1_In_6|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_In_12| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_14|) (let ((.cse6 (not .cse4)) (.cse7 (= (+ v_~result_10~0_Out_26 1) 0)) (.cse8 (not .cse0))) (or (and .cse0 .cse1 (not .cse3) .cse2 .cse5 (= v_~result_10~0_Out_26 (ite .cse6 0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5 .cse6) (and (not .cse2) .cse1 (= (ite .cse8 0 1) v_~result_10~0_Out_26) .cse5) (and .cse1 .cse2 .cse7 .cse8 .cse5))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_In_5| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_14|)))) InVars {thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_In_12|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_In_6|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|, ~filename_5~0=v_~filename_5~0_In_14, ~filename_4~0=v_~filename_4~0_In_12, ~filename_7~0=v_~filename_7~0_In_13, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_In_13|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|, ~filename_8~0=v_~filename_8~0_In_19, ~isNull_3~0=v_~isNull_3~0_In_11, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_In_6|, ~isNull_6~0=v_~isNull_6~0_In_15, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_In_5|} OutVars{thread2Thread1of1ForFork1_#t~ite10#1=|v_thread2Thread1of1ForFork1_#t~ite10#1_Out_26|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_14|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_20|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_28|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~filename_5~0=v_~filename_5~0_In_14, ~filename_4~0=v_~filename_4~0_In_12, ~filename_7~0=v_~filename_7~0_In_13, thread2Thread1of1ForFork1_#t~ite7#1=|v_thread2Thread1of1ForFork1_#t~ite7#1_Out_28|, thread2Thread1of1ForFork1_#t~ite9#1=|v_thread2Thread1of1ForFork1_#t~ite9#1_Out_26|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_14|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|, ~filename_8~0=v_~filename_8~0_In_19, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_20|, ~isNull_3~0=v_~isNull_3~0_In_11, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_14|, ~isNull_6~0=v_~isNull_6~0_In_15, thread2Thread1of1ForFork1_#t~ite8#1=|v_thread2Thread1of1ForFork1_#t~ite8#1_Out_30|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_14|, ~result_10~0=v_~result_10~0_Out_26, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_Out_20|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite10#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~ite7#1, thread2Thread1of1ForFork1_#t~ite9#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~ite8#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~result_10~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-06 05:06:26,890 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:06:26,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1082 [2022-12-06 05:06:26,891 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 117 flow [2022-12-06 05:06:26,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:26,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:26,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:26,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:06:26,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:06:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2079554532, now seen corresponding path program 1 times [2022-12-06 05:06:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:26,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383796338] [2022-12-06 05:06:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383796338] [2022-12-06 05:06:27,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383796338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:27,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:27,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:06:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832872454] [2022-12-06 05:06:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:27,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:06:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:06:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:06:27,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:06:27,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 117 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:27,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:27,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:06:27,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:27,617 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-06 05:06:27,617 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-06 05:06:27,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 99 events. 31/99 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 318 event pairs, 6 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 324. Up to 61 conditions per place. [2022-12-06 05:06:27,618 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 25 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2022-12-06 05:06:27,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 223 flow [2022-12-06 05:06:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:06:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:06:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 05:06:27,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 05:06:27,621 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 117 flow. Second operand 5 states and 38 transitions. [2022-12-06 05:06:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 223 flow [2022-12-06 05:06:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 210 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:06:27,625 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2022-12-06 05:06:27,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2022-12-06 05:06:27,627 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-06 05:06:27,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:27,627 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 78 flow [2022-12-06 05:06:27,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:27,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:27,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 78 flow [2022-12-06 05:06:27,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 78 flow [2022-12-06 05:06:27,637 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 05:06:27,637 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:06:27,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 29 events. 0/29 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 05:06:27,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 78 flow [2022-12-06 05:06:27,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 05:06:27,639 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:27,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:06:27,641 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 78 flow [2022-12-06 05:06:27,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:27,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:27,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:27,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:06:27,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:06:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:27,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1743823913, now seen corresponding path program 3 times [2022-12-06 05:06:27,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:27,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044885235] [2022-12-06 05:06:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:27,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:28,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044885235] [2022-12-06 05:06:28,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044885235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:28,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:28,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:06:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922253367] [2022-12-06 05:06:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:06:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:06:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:06:28,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:06:28,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:28,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:28,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:06:28,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:28,646 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-06 05:06:28,646 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-06 05:06:28,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 84 events. 28/84 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 278. Up to 37 conditions per place. [2022-12-06 05:06:28,647 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-06 05:06:28,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 216 flow [2022-12-06 05:06:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:06:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:06:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-06 05:06:28,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:06:28,648 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 78 flow. Second operand 6 states and 40 transitions. [2022-12-06 05:06:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 216 flow [2022-12-06 05:06:28,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 200 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:06:28,650 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 63 flow [2022-12-06 05:06:28,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-06 05:06:28,651 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 05:06:28,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:06:28,651 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 63 flow [2022-12-06 05:06:28,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:06:28,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:28,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 63 flow [2022-12-06 05:06:28,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 63 flow [2022-12-06 05:06:28,656 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 05:06:28,656 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:06:28,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 16 events. 0/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 05:06:28,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 63 flow [2022-12-06 05:06:28,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 05:06:28,657 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:28,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 05:06:28,658 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 63 flow [2022-12-06 05:06:28,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:28,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:06:28,658 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:06:28,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:06:28,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:06:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:06:28,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1784253107, now seen corresponding path program 4 times [2022-12-06 05:06:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:06:28,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114490740] [2022-12-06 05:06:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:06:28,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:06:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:06:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:06:29,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:06:29,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114490740] [2022-12-06 05:06:29,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114490740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:06:29,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:06:29,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:06:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531989658] [2022-12-06 05:06:29,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:06:29,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:06:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:06:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:06:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:06:29,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:06:29,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 16 transitions, 63 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:29,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:06:29,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:06:29,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:29,579 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-06 05:06:29,580 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 05:06:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 37 events. 11/37 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2022-12-06 05:06:29,580 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-06 05:06:29,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 137 flow [2022-12-06 05:06:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:06:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:06:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-06 05:06:29,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-06 05:06:29,581 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 63 flow. Second operand 6 states and 27 transitions. [2022-12-06 05:06:29,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 137 flow [2022-12-06 05:06:29,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 120 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 05:06:29,582 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-06 05:06:29,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2022-12-06 05:06:29,583 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-06 05:06:29,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:06:29,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-06 05:06:29,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:06:29,584 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:06:29,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:06:29,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:06:29,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:06:29,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:06:29,585 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:06:29,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 05:06:29,586 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:06:29,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:06:29,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:06:29,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:06:29,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:06:29,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:06:29,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:06:29,589 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-06 05:06:29,591 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:06:29,591 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:06:29,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:06:29 BasicIcfg [2022-12-06 05:06:29,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:06:29,594 INFO L158 Benchmark]: Toolchain (without parser) took 17191.40ms. Allocated memory was 173.0MB in the beginning and 299.9MB in the end (delta: 126.9MB). Free memory was 148.8MB in the beginning and 201.1MB in the end (delta: -52.3MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2022-12-06 05:06:29,595 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 104.9MB in the beginning and 104.8MB in the end (delta: 86.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:06:29,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.86ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 137.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:06:29,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 173.0MB. Free memory was 137.2MB in the beginning and 134.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:06:29,596 INFO L158 Benchmark]: Boogie Preprocessor took 45.41ms. Allocated memory is still 173.0MB. Free memory was 134.7MB in the beginning and 133.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:06:29,596 INFO L158 Benchmark]: RCFGBuilder took 531.92ms. Allocated memory is still 173.0MB. Free memory was 133.0MB in the beginning and 114.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 05:06:29,596 INFO L158 Benchmark]: TraceAbstraction took 16276.31ms. Allocated memory was 173.0MB in the beginning and 299.9MB in the end (delta: 126.9MB). Free memory was 113.5MB in the beginning and 201.1MB in the end (delta: -87.5MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-06 05:06:29,597 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.10ms. Allocated memory is still 127.9MB. Free memory was 104.9MB in the beginning and 104.8MB in the end (delta: 86.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.86ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 137.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 173.0MB. Free memory was 137.2MB in the beginning and 134.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.41ms. Allocated memory is still 173.0MB. Free memory was 134.7MB in the beginning and 133.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 531.92ms. Allocated memory is still 173.0MB. Free memory was 133.0MB in the beginning and 114.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 16276.31ms. Allocated memory was 173.0MB in the beginning and 299.9MB in the end (delta: 126.9MB). Free memory was 113.5MB in the beginning and 201.1MB in the end (delta: -87.5MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 203 PlacesBefore, 26 PlacesAfterwards, 212 TransitionsBefore, 16 TransitionsAfterwards, 14784 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 54 TrivialYvCompositions, 123 ConcurrentYvCompositions, 13 ChoiceCompositions, 190 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9936, independent: 9936, independent conditional: 9936, 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: 9936, independent: 9936, independent conditional: 0, independent unconditional: 9936, 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: 9936, independent: 9936, independent conditional: 0, independent unconditional: 9936, 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: 9936, independent: 9936, independent conditional: 0, independent unconditional: 9936, 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: 8572, independent: 8572, independent conditional: 0, independent unconditional: 8572, 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: 8572, independent: 8572, independent conditional: 0, independent unconditional: 8572, 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: 9936, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8572, unknown conditional: 0, unknown unconditional: 8572] , Statistics on independence cache: Total cache size (in pairs): 19588, Positive cache size: 19588, Positive conditional cache size: 0, Positive unconditional cache size: 19588, 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, 27 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, 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.1s, 34 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 83]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 327 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384 IncrementalHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:06:29,628 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...