/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:06:16,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:06:16,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:06:16,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:06:16,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:06:16,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:06:16,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:06:16,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:06:16,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:06:16,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:06:16,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:06:16,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:06:16,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:06:16,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:06:16,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:06:16,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:06:16,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:06:16,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:06:16,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:06:16,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:06:16,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:06:16,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:06:16,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:06:16,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:06:16,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:06:16,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:06:16,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:06:16,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:06:16,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:06:16,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:06:16,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:06:16,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:06:16,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:06:17,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:06:17,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:06:17,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:06:17,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:06:17,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:06:17,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:06:17,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:06:17,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:06:17,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:06:17,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:06:17,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:06:17,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:06:17,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:06:17,062 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:06:17,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:06:17,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:06:17,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:06:17,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:06:17,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:06:17,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:06:17,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:06:17,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:06:17,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:06:17,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:06:17,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:06:17,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:06:17,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:06:17,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:06:17,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:06:17,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:06:17,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:06:17,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:06:17,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:06:17,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:06:17,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:06:17,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:06:17,067 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:06:17,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:06:17,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:06:17,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:06:17,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:06:17,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:06:17,661 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:06:17,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-2.wvr.c [2022-12-06 00:06:19,485 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:06:19,870 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:06:19,871 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-2.wvr.c [2022-12-06 00:06:19,894 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e8d18b2/7160d98f6d614469bb39dc4cdd4f13c7/FLAGbbeb87044 [2022-12-06 00:06:19,943 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e8d18b2/7160d98f6d614469bb39dc4cdd4f13c7 [2022-12-06 00:06:19,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:06:19,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:06:19,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:06:19,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:06:19,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:06:19,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:06:19" (1/1) ... [2022-12-06 00:06:19,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a6bb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:19, skipping insertion in model container [2022-12-06 00:06:19,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:06:19" (1/1) ... [2022-12-06 00:06:19,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:06:19,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:06:20,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,202 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/parallel-ticket-2.wvr.c[2652,2665] [2022-12-06 00:06:20,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:06:20,217 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:06:20,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:06:20,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:06:20,290 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/parallel-ticket-2.wvr.c[2652,2665] [2022-12-06 00:06:20,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:06:20,304 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:06:20,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20 WrapperNode [2022-12-06 00:06:20,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:06:20,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:06:20,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:06:20,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:06:20,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,407 INFO L138 Inliner]: procedures = 21, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2022-12-06 00:06:20,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:06:20,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:06:20,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:06:20,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:06:20,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,454 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:06:20,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:06:20,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:06:20,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:06:20,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (1/1) ... [2022-12-06 00:06:20,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:06:20,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:06:20,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:06:20,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:06:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:06:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:06:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:06:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:06:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:06:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:06:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:06:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:06:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:06:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:06:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:06:20,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:06:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:06:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:06:20,559 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:06:20,703 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:06:20,705 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:06:21,008 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:06:21,084 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:06:21,085 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 00:06:21,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:06:21 BoogieIcfgContainer [2022-12-06 00:06:21,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:06:21,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:06:21,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:06:21,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:06:21,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:06:19" (1/3) ... [2022-12-06 00:06:21,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563c3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:06:21, skipping insertion in model container [2022-12-06 00:06:21,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:06:20" (2/3) ... [2022-12-06 00:06:21,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563c3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:06:21, skipping insertion in model container [2022-12-06 00:06:21,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:06:21" (3/3) ... [2022-12-06 00:06:21,101 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-2.wvr.c [2022-12-06 00:06:21,117 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:06:21,118 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:06:21,118 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:06:21,189 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:06:21,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 194 flow [2022-12-06 00:06:21,328 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 00:06:21,328 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:06:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 2/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2022-12-06 00:06:21,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 194 flow [2022-12-06 00:06:21,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 79 transitions, 170 flow [2022-12-06 00:06:21,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:21,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 79 transitions, 170 flow [2022-12-06 00:06:21,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 170 flow [2022-12-06 00:06:21,457 INFO L130 PetriNetUnfolder]: 2/79 cut-off events. [2022-12-06 00:06:21,457 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:06:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 2/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2022-12-06 00:06:21,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 79 transitions, 170 flow [2022-12-06 00:06:21,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 00:06:27,271 INFO L203 LiptonReduction]: Total number of compositions: 65 [2022-12-06 00:06:27,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:06:27,291 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;@51c135d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:06:27,292 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:06:27,296 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 00:06:27,296 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:06:27,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:27,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:27,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:06:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1455503599, now seen corresponding path program 1 times [2022-12-06 00:06:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:27,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521880848] [2022-12-06 00:06:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:27,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:27,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521880848] [2022-12-06 00:06:27,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521880848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:27,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:27,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:06:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686719538] [2022-12-06 00:06:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:27,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:06:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:06:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:06:27,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 00:06:27,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 40 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:27,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:27,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 00:06:27,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:28,090 INFO L130 PetriNetUnfolder]: 33/81 cut-off events. [2022-12-06 00:06:28,090 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 00:06:28,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 81 events. 33/81 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 4 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 136. Up to 45 conditions per place. [2022-12-06 00:06:28,093 INFO L137 encePairwiseOnDemand]: 7/14 looper letters, 19 selfloop transitions, 4 changer transitions 9/32 dead transitions. [2022-12-06 00:06:28,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 152 flow [2022-12-06 00:06:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:06:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:06:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-12-06 00:06:28,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 00:06:28,107 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 40 flow. Second operand 6 states and 33 transitions. [2022-12-06 00:06:28,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 152 flow [2022-12-06 00:06:28,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:06:28,121 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 60 flow [2022-12-06 00:06:28,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-06 00:06:28,126 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 00:06:28,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:28,126 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 60 flow [2022-12-06 00:06:28,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:28,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:28,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 60 flow [2022-12-06 00:06:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 60 flow [2022-12-06 00:06:28,134 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-06 00:06:28,134 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:06:28,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 16 events. 1/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 28. Up to 5 conditions per place. [2022-12-06 00:06:28,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 60 flow [2022-12-06 00:06:28,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 00:06:28,238 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [243] $Ultimate##0-->L67: Formula: (and (= v_~t~0_20 (+ v_~t~0_21 1)) (= v_~m2~0_11 v_~t~0_21)) InVars {~t~0=v_~t~0_21} OutVars{thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_20} AuxVars[] AssignedVars[~m2~0, thread2Thread1of1ForFork0_#t~post3#1, ~t~0] and [331] $Ultimate##0-->L52: Formula: (and (= v_~x~0_99 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|) (= v_~m1~0_65 v_~t~0_83) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19| (ite (<= v_~m1~0_65 v_~s~0_190) 1 0)) (= v_~t~0_82 (+ v_~t~0_83 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~s~0=v_~s~0_190, ~t~0=v_~t~0_83} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_11|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, ~m1~0=v_~m1~0_65, ~x~0=v_~x~0_99, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~s~0=v_~s~0_190, ~t~0=v_~t~0_82} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~m1~0, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] [2022-12-06 00:06:28,362 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:06:28,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 00:06:28,365 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 63 flow [2022-12-06 00:06:28,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:28,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:28,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:28,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:06:28,368 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:06:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2011106604, now seen corresponding path program 1 times [2022-12-06 00:06:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:28,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252326027] [2022-12-06 00:06:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:28,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:28,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252326027] [2022-12-06 00:06:28,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252326027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:28,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:28,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:06:28,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131443346] [2022-12-06 00:06:28,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:06:28,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:06:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:06:28,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 00:06:28,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 63 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:28,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:28,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 00:06:28,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:28,671 INFO L130 PetriNetUnfolder]: 20/56 cut-off events. [2022-12-06 00:06:28,671 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 00:06:28,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 56 events. 20/56 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 5 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 165. Up to 22 conditions per place. [2022-12-06 00:06:28,672 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 13 selfloop transitions, 5 changer transitions 10/28 dead transitions. [2022-12-06 00:06:28,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 157 flow [2022-12-06 00:06:28,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:06:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:06:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-12-06 00:06:28,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-06 00:06:28,673 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 63 flow. Second operand 5 states and 29 transitions. [2022-12-06 00:06:28,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 157 flow [2022-12-06 00:06:28,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 144 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:28,675 INFO L231 Difference]: Finished difference. Result has 26 places, 14 transitions, 64 flow [2022-12-06 00:06:28,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=26, PETRI_TRANSITIONS=14} [2022-12-06 00:06:28,676 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 00:06:28,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:28,676 INFO L89 Accepts]: Start accepts. Operand has 26 places, 14 transitions, 64 flow [2022-12-06 00:06:28,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:28,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:28,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 14 transitions, 64 flow [2022-12-06 00:06:28,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 14 transitions, 64 flow [2022-12-06 00:06:28,680 INFO L130 PetriNetUnfolder]: 1/14 cut-off events. [2022-12-06 00:06:28,680 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 00:06:28,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 14 events. 1/14 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2022-12-06 00:06:28,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 14 transitions, 64 flow [2022-12-06 00:06:28,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 00:06:28,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] $Ultimate##0-->L52: Formula: (and (= v_~m2~0_71 v_~t~0_88) (= v_~t~0_86 (+ v_~m1~0_67 1)) (= v_~x~0_101 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| (ite (<= v_~m1~0_67 v_~s~0_192) 1 0)) (= v_~m1~0_67 (+ v_~t~0_88 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|)) InVars {~s~0=v_~s~0_192, ~t~0=v_~t~0_88} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~m1~0=v_~m1~0_67, ~m2~0=v_~m2~0_71, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_9|, ~x~0=v_~x~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, ~s~0=v_~s~0_192, ~t~0=v_~t~0_86} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~m1~0, ~m2~0, thread2Thread1of1ForFork0_#t~post3#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] and [312] L67-->thread2EXIT: Formula: (and (= (+ v_~s~0_139 1) v_~s~0_138) (= (ite (= (ite (or (not (= (mod v_~b~0_74 256) 0)) (= v_~x~0_60 1)) 1 0) 0) 0 1) v_~b~0_73) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= (ite (<= v_~m2~0_43 v_~s~0_139) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0))) InVars {~b~0=v_~b~0_74, ~m2~0=v_~m2~0_43, ~x~0=v_~x~0_60, ~s~0=v_~s~0_139} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, ~b~0=v_~b~0_73, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~m2~0=v_~m2~0_43, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_33|, ~x~0=v_~x~0_60, ~s~0=v_~s~0_138} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, ~b~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4#1, ~s~0] [2022-12-06 00:06:28,856 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|) (= v_~m1~0_63 v_~t~0_79) (= v_~t~0_78 (+ v_~t~0_79 1)) (= v_~x~0_97 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17| (ite (<= v_~m1~0_63 v_~s~0_188) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0))) InVars {~s~0=v_~s~0_188, ~t~0=v_~t~0_79} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_9|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_97, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~s~0=v_~s~0_188, ~t~0=v_~t~0_78} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~m1~0, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] and [333] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~m2~0_75 v_~t~0_93) (= (+ v_~s~0_201 1) v_~s~0_200) (= |v_thread2Thread1of1ForFork0_#res#1.base_31| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m2~0_75 v_~s~0_201) 1 0)) (= v_~b~0_127 (ite (= (ite (or (= v_~x~0_106 1) (not (= (mod v_~b~0_128 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_31| 0) (= (+ v_~t~0_93 1) v_~t~0_92)) InVars {~b~0=v_~b~0_128, ~x~0=v_~x~0_106, ~s~0=v_~s~0_201, ~t~0=v_~t~0_93} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_31|, ~b~0=v_~b~0_127, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_31|, ~m2~0=v_~m2~0_75, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_11|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_47|, ~x~0=v_~x~0_106, ~s~0=v_~s~0_200, ~t~0=v_~t~0_92} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, ~b~0, thread2Thread1of1ForFork0_#res#1.offset, ~m2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1, ~s~0, ~t~0] [2022-12-06 00:06:29,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_111 1))) (and (= (ite (<= v_~m2~0_79 v_~s~0_211) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (= v_~t~0_100 (+ v_~m1~0_69 1)) (= (ite (<= v_~m1~0_69 v_~s~0_211) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_35| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_35| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|) .cse0 (= v_~t~0_101 v_~m2~0_79) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (= v_~b~0_135 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_136 256) 0))) 1 0) 0) 0 1)) (= (+ v_~s~0_211 1) v_~s~0_210) (= v_~m1~0_69 (+ v_~t~0_101 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0)))) InVars {~b~0=v_~b~0_136, ~s~0=v_~s~0_211, ~t~0=v_~t~0_101} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_35|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_15|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_35|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_15|, ~b~0=v_~b~0_135, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, ~m2~0=v_~m2~0_79, ~m1~0=v_~m1~0_69, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_51|, ~x~0=v_~x~0_111, ~s~0=v_~s~0_210, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, ~t~0=v_~t~0_100} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork1_#t~post1#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~m2~0, ~m1~0, thread2Thread1of1ForFork0_#t~post4#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] and [280] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= v_~x~0_37 0) (= v_~s~0_108 (+ v_~s~0_109 1))) InVars {~s~0=v_~s~0_109} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_19|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|, ~x~0=v_~x~0_37, ~s~0=v_~s~0_108} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:06:29,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_113 1))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#res#1.base_37| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|) (= (ite (= (ite (or .cse0 (not (= 0 (mod v_~b~0_140 256)))) 1 0) 0) 0 1) v_~b~0_139) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33| (ite (<= v_~m2~0_81 v_~s~0_215) 1 0)) (= (ite (<= v_~m1~0_71 v_~s~0_215) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_37| 0) (= (+ v_~s~0_215 1) v_~s~0_214) (= v_~t~0_106 v_~m1~0_71) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|) (= v_~t~0_104 (+ v_~m2~0_81 1)) (= v_~m2~0_81 (+ v_~t~0_106 1)))) InVars {~b~0=v_~b~0_140, ~s~0=v_~s~0_215, ~t~0=v_~t~0_106} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_37|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_17|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_37|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_17|, ~b~0=v_~b~0_139, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~m2~0=v_~m2~0_81, ~m1~0=v_~m1~0_71, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_53|, ~x~0=v_~x~0_113, ~s~0=v_~s~0_214, ~t~0=v_~t~0_104, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork1_#t~post1#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~m2~0, ~m1~0, thread2Thread1of1ForFork0_#t~post4#1, ~x~0, ~s~0, ~t~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [280] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= v_~x~0_37 0) (= v_~s~0_108 (+ v_~s~0_109 1))) InVars {~s~0=v_~s~0_109} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_19|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|, ~x~0=v_~x~0_37, ~s~0=v_~s~0_108} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 00:06:29,282 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:06:29,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 607 [2022-12-06 00:06:29,283 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 11 transitions, 52 flow [2022-12-06 00:06:29,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:29,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:29,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:29,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:06:29,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:06:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash -890313050, now seen corresponding path program 1 times [2022-12-06 00:06:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:29,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824977124] [2022-12-06 00:06:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:29,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824977124] [2022-12-06 00:06:29,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824977124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:29,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:29,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:06:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967602526] [2022-12-06 00:06:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:29,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:06:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:06:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:06:29,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-06 00:06:29,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 11 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:29,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:29,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-06 00:06:29,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:29,392 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-06 00:06:29,392 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 00:06:29,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 5 events. 0/5 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 2/7 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-06 00:06:29,392 INFO L137 encePairwiseOnDemand]: 8/11 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2022-12-06 00:06:29,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 5 transitions, 26 flow [2022-12-06 00:06:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:06:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:06:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-12-06 00:06:29,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21212121212121213 [2022-12-06 00:06:29,393 INFO L175 Difference]: Start difference. First operand has 21 places, 11 transitions, 52 flow. Second operand 3 states and 7 transitions. [2022-12-06 00:06:29,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 5 transitions, 26 flow [2022-12-06 00:06:29,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 5 transitions, 24 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:06:29,394 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2022-12-06 00:06:29,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=14, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2022-12-06 00:06:29,395 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -6 predicate places. [2022-12-06 00:06:29,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:29,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 0 transitions, 0 flow [2022-12-06 00:06:29,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 00:06:29,395 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 00:06:29,395 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:06:29,396 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 00:06:29,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 00:06:29,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:06:29,396 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:06:29,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 00:06:29,397 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 00:06:29,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:29,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 00:06:29,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 00:06:29,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 00:06:29,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:06:29,400 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-06 00:06:29,403 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:06:29,403 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:06:29,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:06:29 BasicIcfg [2022-12-06 00:06:29,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:06:29,407 INFO L158 Benchmark]: Toolchain (without parser) took 9456.43ms. Allocated memory was 170.9MB in the beginning and 247.5MB in the end (delta: 76.5MB). Free memory was 146.2MB in the beginning and 171.0MB in the end (delta: -24.9MB). Peak memory consumption was 51.7MB. Max. memory is 8.0GB. [2022-12-06 00:06:29,407 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 170.9MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:06:29,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.03ms. Allocated memory is still 170.9MB. Free memory was 145.6MB in the beginning and 133.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:06:29,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.86ms. Allocated memory is still 170.9MB. Free memory was 133.0MB in the beginning and 131.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:06:29,408 INFO L158 Benchmark]: Boogie Preprocessor took 48.13ms. Allocated memory is still 170.9MB. Free memory was 131.5MB in the beginning and 129.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:06:29,408 INFO L158 Benchmark]: RCFGBuilder took 635.48ms. Allocated memory is still 170.9MB. Free memory was 129.9MB in the beginning and 113.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 00:06:29,408 INFO L158 Benchmark]: TraceAbstraction took 8311.58ms. Allocated memory was 170.9MB in the beginning and 247.5MB in the end (delta: 76.5MB). Free memory was 112.6MB in the beginning and 171.0MB in the end (delta: -58.4MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2022-12-06 00:06:29,410 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.17ms. Allocated memory is still 170.9MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.03ms. Allocated memory is still 170.9MB. Free memory was 145.6MB in the beginning and 133.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.86ms. Allocated memory is still 170.9MB. Free memory was 133.0MB in the beginning and 131.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.13ms. Allocated memory is still 170.9MB. Free memory was 131.5MB in the beginning and 129.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 635.48ms. Allocated memory is still 170.9MB. Free memory was 129.9MB in the beginning and 113.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 8311.58ms. Allocated memory was 170.9MB in the beginning and 247.5MB in the end (delta: 76.5MB). Free memory was 112.6MB in the beginning and 171.0MB in the end (delta: -58.4MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 84 PlacesBefore, 21 PlacesAfterwards, 79 TransitionsBefore, 14 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 48 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 65 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 208, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 208, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 208, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 191, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 191, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 191, unknown conditional: 0, unknown unconditional: 191] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 266, Positive conditional cache size: 0, Positive unconditional cache size: 266, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 24 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 21, independent conditional: 1, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 1, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 16, unknown conditional: 1, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 13, Positive conditional cache size: 1, Positive unconditional cache size: 12, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 24 PlacesBefore, 21 PlacesAfterwards, 14 TransitionsBefore, 11 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 19, Positive conditional cache size: 3, Positive unconditional cache size: 16, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 19, Positive conditional cache size: 3, Positive unconditional cache size: 16, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 102]: 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 5 procedures, 105 locations, 3 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: 8.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 0 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 14, 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 00:06:29,432 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...