/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 03:13:28,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 03:13:28,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 03:13:28,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 03:13:28,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 03:13:28,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 03:13:28,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 03:13:28,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 03:13:28,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 03:13:28,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 03:13:28,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 03:13:28,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 03:13:28,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 03:13:28,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 03:13:28,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 03:13:28,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 03:13:28,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 03:13:28,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 03:13:28,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 03:13:28,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 03:13:28,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 03:13:28,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 03:13:28,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 03:13:28,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 03:13:28,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 03:13:28,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 03:13:28,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 03:13:28,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 03:13:28,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 03:13:28,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 03:13:28,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 03:13:28,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 03:13:28,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 03:13:28,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 03:13:28,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 03:13:28,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 03:13:28,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 03:13:28,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 03:13:28,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 03:13:28,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 03:13:28,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 03:13:28,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 03:13:28,290 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 03:13:28,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 03:13:28,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 03:13:28,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 03:13:28,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 03:13:28,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 03:13:28,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 03:13:28,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 03:13:28,292 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 03:13:28,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 03:13:28,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 03:13:28,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 03:13:28,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 03:13:28,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 03:13:28,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 03:13:28,295 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 03:13:28,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 03:13:28,295 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 03:13:28,295 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> true [2023-05-04 03:13:28,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 03:13:28,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 03:13:28,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 03:13:28,517 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 03:13:28,518 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 03:13:28,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2023-05-04 03:13:28,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04d9cd44/ee57cae5e65a43e0a8ed71fc4880d53a/FLAG058749e40 [2023-05-04 03:13:28,968 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 03:13:28,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2023-05-04 03:13:28,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04d9cd44/ee57cae5e65a43e0a8ed71fc4880d53a/FLAG058749e40 [2023-05-04 03:13:28,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04d9cd44/ee57cae5e65a43e0a8ed71fc4880d53a [2023-05-04 03:13:28,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 03:13:28,985 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 03:13:28,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 03:13:28,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 03:13:28,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 03:13:28,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 03:13:28" (1/1) ... [2023-05-04 03:13:28,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7137240f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:28, skipping insertion in model container [2023-05-04 03:13:28,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 03:13:28" (1/1) ... [2023-05-04 03:13:28,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 03:13:29,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 03:13:29,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2023-05-04 03:13:29,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 03:13:29,198 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 03:13:29,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2023-05-04 03:13:29,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 03:13:29,233 INFO L208 MainTranslator]: Completed translation [2023-05-04 03:13:29,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29 WrapperNode [2023-05-04 03:13:29,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 03:13:29,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 03:13:29,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 03:13:29,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 03:13:29,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,267 INFO L138 Inliner]: procedures = 21, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2023-05-04 03:13:29,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 03:13:29,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 03:13:29,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 03:13:29,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 03:13:29,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,281 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 03:13:29,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 03:13:29,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 03:13:29,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 03:13:29,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (1/1) ... [2023-05-04 03:13:29,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 03:13:29,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:29,312 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) [2023-05-04 03:13:29,317 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 [2023-05-04 03:13:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 03:13:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 03:13:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 03:13:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 03:13:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 03:13:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 03:13:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 03:13:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 03:13:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 03:13:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 03:13:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 03:13:29,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 03:13:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 03:13:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 03:13:29,366 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 03:13:29,464 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 03:13:29,465 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 03:13:29,631 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 03:13:29,664 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 03:13:29,665 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 03:13:29,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 03:13:29 BoogieIcfgContainer [2023-05-04 03:13:29,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 03:13:29,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 03:13:29,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 03:13:29,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 03:13:29,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 03:13:28" (1/3) ... [2023-05-04 03:13:29,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be1f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 03:13:29, skipping insertion in model container [2023-05-04 03:13:29,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:29" (2/3) ... [2023-05-04 03:13:29,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be1f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 03:13:29, skipping insertion in model container [2023-05-04 03:13:29,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 03:13:29" (3/3) ... [2023-05-04 03:13:29,672 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2023-05-04 03:13:29,678 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 03:13:29,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 03:13:29,684 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 03:13:29,684 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 03:13:29,722 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 03:13:29,771 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 03:13:29,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 03:13:29,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:29,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 03:13:29,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 03:13:29,830 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 03:13:29,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 03:13:29,874 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@446443cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 03:13:29,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 03:13:30,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:13:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:30,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1379718199, now seen corresponding path program 1 times [2023-05-04 03:13:30,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:30,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768235682] [2023-05-04 03:13:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:30,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:30,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768235682] [2023-05-04 03:13:30,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768235682] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 03:13:30,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 03:13:30,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 03:13:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555611251] [2023-05-04 03:13:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:13:30,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 03:13:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 03:13:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 03:13:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:30,279 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:30,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 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) [2023-05-04 03:13:30,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:30,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 03:13:30,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:13:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1918176744, now seen corresponding path program 1 times [2023-05-04 03:13:30,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:30,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092301026] [2023-05-04 03:13:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:31,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092301026] [2023-05-04 03:13:31,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092301026] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:31,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148611300] [2023-05-04 03:13:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:31,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:31,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:31,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:13:31,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 03:13:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:31,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2023-05-04 03:13:31,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:31,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:31,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148611300] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:13:31,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:13:31,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 19 [2023-05-04 03:13:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320447255] [2023-05-04 03:13:31,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:13:31,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 03:13:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 03:13:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-05-04 03:13:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:31,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:31,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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) [2023-05-04 03:13:31,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:31,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:32,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 03:13:32,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 03:13:32,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-04 03:13:32,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:13:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1002469134, now seen corresponding path program 1 times [2023-05-04 03:13:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:32,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323648899] [2023-05-04 03:13:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:34,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323648899] [2023-05-04 03:13:34,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323648899] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:34,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165783108] [2023-05-04 03:13:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:34,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:34,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:34,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:13:34,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 03:13:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:34,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjunts are in the unsatisfiable core [2023-05-04 03:13:34,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:35,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165783108] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:13:39,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:13:39,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 40 [2023-05-04 03:13:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42027938] [2023-05-04 03:13:39,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:13:39,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 03:13:39,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:39,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 03:13:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2023-05-04 03:13:39,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:39,017 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:39,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 40 states have internal predecessors, (165), 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) [2023-05-04 03:13:39,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:39,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 03:13:39,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:46,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 03:13:46,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-04 03:13:46,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 03:13:47,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:47,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:13:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1747078489, now seen corresponding path program 2 times [2023-05-04 03:13:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:47,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695801603] [2023-05-04 03:13:47,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:49,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695801603] [2023-05-04 03:13:49,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695801603] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:49,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833276724] [2023-05-04 03:13:49,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 03:13:49,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:49,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:13:49,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 03:13:49,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 03:13:49,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:13:49,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 34 conjunts are in the unsatisfiable core [2023-05-04 03:13:49,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:52,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:57,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833276724] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:13:57,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:13:57,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 21] total 55 [2023-05-04 03:13:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057989076] [2023-05-04 03:13:57,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:13:57,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-05-04 03:13:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-05-04 03:13:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=2524, Unknown=0, NotChecked=0, Total=2970 [2023-05-04 03:13:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:57,150 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:57,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.4909090909090907) internal successors, (192), 55 states have internal predecessors, (192), 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) [2023-05-04 03:13:57,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:57,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 03:13:57,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-05-04 03:13:57,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:14:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:14:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 03:14:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-04 03:14:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-04 03:14:36,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 03:14:36,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:14:36,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 03:14:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:14:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1941460217, now seen corresponding path program 3 times [2023-05-04 03:14:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:14:36,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601440365] [2023-05-04 03:14:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:14:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:14:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:14:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:14:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:14:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601440365] [2023-05-04 03:14:44,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601440365] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:14:44,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827348984] [2023-05-04 03:14:44,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 03:14:44,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:14:44,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:14:44,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 03:14:44,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 03:14:45,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-05-04 03:14:45,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:14:45,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2023-05-04 03:14:45,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:15:38,744 WARN L233 SmtUtils]: Spent 7.97s on a formula simplification that was a NOOP. DAG size: 159 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 03:15:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:15:40,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:16:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:16:18,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827348984] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:16:18,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:16:18,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 28, 27] total 84 [2023-05-04 03:16:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703338212] [2023-05-04 03:16:18,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:16:18,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-05-04 03:16:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:16:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-05-04 03:16:18,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1094, Invalid=5876, Unknown=2, NotChecked=0, Total=6972 [2023-05-04 03:16:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:16:18,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:16:18,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.0357142857142856) internal successors, (255), 84 states have internal predecessors, (255), 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) [2023-05-04 03:16:18,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:16:18,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 03:16:18,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-05-04 03:16:18,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-05-04 03:16:18,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:16:20,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (+ c_~m~0 10)) (.cse1 (mod (+ c_~S~0 c_~T~0) 4294967296)) (.cse17 (+ c_~m~0 11))) (let ((.cse11 (+ c_~m~0 6)) (.cse5 (* 4294967296 (div (+ c_~m~0 (- 4294967285)) 4294967296))) (.cse4 (* (div .cse17 4294967296) 4294967296)) (.cse12 (+ 7 c_~m~0)) (.cse7 (+ c_~m~0 8)) (.cse3 (< (+ 10 (* (div (+ c_~s~0 (- 10)) 4294967296) 4294967296)) c_~s~0)) (.cse2 (+ c_~m~0 2)) (.cse8 (+ c_~m~0 9)) (.cse10 (+ c_~m~0 5)) (.cse0 (< 0 (mod c_~t~0 4294967296))) (.cse13 (+ c_~m~0 3)) (.cse16 (+ c_~m~0 4)) (.cse9 (and (< c_~m~0 (+ (* (div (+ c_~m~0 (- 4294967286)) 4294967296) 4294967296) .cse1 4294967287)) (< (+ (* 4294967296 (div .cse15 4294967296)) .cse1) .cse17))) (.cse14 (< (+ (* (div (+ c_~s~0 (- 9)) 4294967296) 4294967296) 9) c_~s~0)) (.cse6 (< 0 (mod (+ c_~t~0 4294967295) 4294967296)))) (and (or .cse0 (and (< c_~m~0 (+ .cse1 (* (div (+ c_~m~0 (- 4294967295)) 4294967296) 4294967296) 4294967296)) (< (+ .cse1 (* (div (+ c_~m~0 1) 4294967296) 4294967296)) .cse2)) (< (+ (* (div (+ c_~s~0 (- 1)) 4294967296) 4294967296) 1) c_~s~0)) (or .cse3 (and (< (+ .cse1 .cse4) (+ c_~m~0 12)) (< c_~m~0 (+ .cse1 4294967286 .cse5))) .cse6) (or .cse0 (and (< (+ .cse1 (* (div .cse7 4294967296) 4294967296)) .cse8) (< c_~m~0 (+ (* (div (+ c_~m~0 (- 4294967288)) 4294967296) 4294967296) .cse1 4294967289))) (< (+ (* (div (+ c_~s~0 (- 8)) 4294967296) 4294967296) 8) c_~s~0)) (or .cse3 .cse9 .cse6) (or .cse0 (< (+ 5 (* (div (+ c_~s~0 (- 5)) 4294967296) 4294967296)) c_~s~0) (and (< c_~m~0 (+ 4294967292 .cse1 (* (div (+ (- 4294967291) c_~m~0) 4294967296) 4294967296))) (< (+ (* (div .cse10 4294967296) 4294967296) .cse1) .cse11))) (or .cse0 (and (< c_~m~0 (+ 4294967291 .cse1 (* (div (+ (- 4294967290) c_~m~0) 4294967296) 4294967296))) (< (+ .cse1 (* (div .cse11 4294967296) 4294967296)) .cse12)) (< (+ (* (div (+ c_~s~0 (- 6)) 4294967296) 4294967296) 6) c_~s~0)) (or .cse3 (and (< (+ c_~m~0 (* (div (+ c_~S~0 1) 4294967296) 4294967296)) (+ c_~S~0 4294967287 .cse5)) (< (+ c_~S~0 .cse4) (+ c_~m~0 (* 4294967296 (div (+ c_~S~0 (- 4294967295)) 4294967296)) 4294967307)))) (or .cse0 (and (< c_~m~0 (+ 4294967290 .cse1 (* (div (+ (- 4294967289) c_~m~0) 4294967296) 4294967296))) (< (+ .cse1 (* (div .cse12 4294967296) 4294967296)) .cse7)) (< (+ 7 (* (div (+ c_~s~0 (- 7)) 4294967296) 4294967296)) c_~s~0)) (or .cse3 .cse0 .cse9) (or .cse0 (< (+ 2 (* (div (+ c_~s~0 (- 2)) 4294967296) 4294967296)) c_~s~0) (and (< c_~m~0 (+ .cse1 4294967295 (* 4294967296 (div (+ c_~m~0 (- 4294967294)) 4294967296)))) (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) .cse13))) (or .cse0 .cse14 (and (< c_~m~0 (+ (* (div (+ (- 4294967287) c_~m~0) 4294967296) 4294967296) 4294967288 .cse1)) (< (+ (* (div .cse8 4294967296) 4294967296) .cse1) .cse15))) (or .cse0 (and (< (+ (* (div .cse16 4294967296) 4294967296) .cse1) .cse10) (< c_~m~0 (+ .cse1 (* (div (+ (- 4294967292) c_~m~0) 4294967296) 4294967296) 4294967293))) (< (+ (* 4294967296 (div (+ c_~s~0 (- 4)) 4294967296)) 4) c_~s~0)) (or .cse0 (and (< c_~m~0 (+ .cse1 4294967294 (* (div (+ c_~m~0 (- 4294967293)) 4294967296) 4294967296))) (< (+ (* (div .cse13 4294967296) 4294967296) .cse1) .cse16)) (< (+ (* (div (+ c_~s~0 (- 3)) 4294967296) 4294967296) 3) c_~s~0)) (or .cse9 .cse14 .cse6)))) is different from false [2023-05-04 03:17:27,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:17:30,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:18:19,814 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~s~0 8)) (.cse3 (* (div c_~t~0 4294967296) 4294967296))) (and (< 0 (mod c_~S~0 4294967296)) (< 0 (mod c_~T~0 4294967296)) (or (let ((.cse2 (div c_~m~0 4294967296))) (let ((.cse0 (* (div (+ c_~S~0 c_~T~0) 4294967296) 4294967296)) (.cse1 (+ c_~S~0 c_~T~0 (* .cse2 4294967296)))) (and (not (<= (+ c_~m~0 .cse0 1) .cse1)) (<= .cse2 0) (<= (+ c_~m~0 .cse0) .cse1)))) (and (<= (div c_thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 c_thread1Thread1of1ForFork1_~cond~0))) (= c_~T~0 (+ c_~t~0 1)) (<= c_~t~0 .cse3) (let ((.cse4 (+ c_~s~0 1))) (or (and (= c_~m~0 2) (= .cse4 c_~S~0) (<= (+ (* (div (+ (- 2) c_~S~0) 4294967296) 4294967296) 4294967297) c_~S~0)) (and (= c_~S~0 (+ c_~s~0 5)) (<= (+ (* (div (+ c_~S~0 (- 6)) 4294967296) 4294967296) 4294967301) c_~S~0) (= c_~m~0 6)) (and (or (and (= c_~m~0 10) (< 0 (mod .cse4 4294967296)) (= c_~S~0 (+ c_~s~0 9)) (< 0 (mod (+ c_~S~0 4294967289) 4294967296))) (and (or (and (= c_~m~0 8) (= (+ c_~s~0 7) c_~S~0)) (and (= .cse5 c_~S~0) (= c_~m~0 9))) (not (< 0 (mod c_~s~0 4294967296))))) (< 0 (mod (+ 4294967292 c_~S~0) 4294967296)) (< 0 (mod (+ c_~S~0 4294967291) 4294967296)) (< 0 (mod (+ 4294967290 c_~S~0) 4294967296)) (< 0 (mod (+ c_~S~0 4294967295) 4294967296)) (< 0 (mod (+ c_~S~0 4294967294) 4294967296)) (< 0 (mod (+ c_~S~0 4294967293) 4294967296))) (and (<= (+ (* (div (+ c_~S~0 (- 3)) 4294967296) 4294967296) 4294967298) c_~S~0) (= c_~m~0 3) (= c_~S~0 (+ c_~s~0 2))) (and (= c_~m~0 5) (= c_~S~0 (+ c_~s~0 4)) (<= (+ (* (div (+ c_~S~0 (- 5)) 4294967296) 4294967296) 4294967300) c_~S~0)) (and (= c_~m~0 4) (<= (+ (* (div (+ c_~S~0 (- 4)) 4294967296) 4294967296) 4294967299) c_~S~0) (= (+ c_~s~0 3) c_~S~0)) (and (= (+ c_~s~0 6) c_~S~0) (= 7 c_~m~0) (<= (+ 4294967302 (* (div (+ c_~S~0 (- 7)) 4294967296) 4294967296)) c_~S~0)))) (or (<= .cse5 (* (div .cse5 4294967296) 4294967296)) (let ((.cse6 (+ c_~S~0 c_~T~0 .cse3)) (.cse7 (- c_~s~0))) (and (<= .cse6 (+ c_~s~0 c_~t~0 c_~m~0 (* (div (+ c_~S~0 c_~T~0 .cse7 (- 10)) 4294967296) 4294967296))) (<= .cse6 (+ c_~s~0 c_~t~0 (* (div (+ 4294967292 .cse7) 4294967296) 4294967296) 10 (* (div c_~s~0 4294967296) 4294967296) (* (div (+ c_~S~0 c_~T~0 .cse7 (- c_~m~0)) 4294967296) 4294967296)))))))) is different from false [2023-05-04 03:19:10,394 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 167 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 03:19:13,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:19:15,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:19:17,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:19:18,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:20,493 WARN L233 SmtUtils]: Spent 32.36s on a formula simplification. DAG size of input: 250 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 03:20:27,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:30,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:32,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:35,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:37,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:40,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:41,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:43,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:45,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:47,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:51,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:54,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:20:58,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 03:23:25,244 WARN L233 SmtUtils]: Spent 43.41s on a formula simplification. DAG size of input: 272 DAG size of output: 257 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 03:23:28,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (+ c_~m~0 10)) (.cse1 (mod (+ c_~S~0 c_~T~0) 4294967296)) (.cse2 (+ c_~m~0 11))) (let ((.cse9 (+ c_~m~0 6)) (.cse10 (+ 7 c_~m~0)) (.cse5 (+ c_~m~0 8)) (.cse0 (< (+ 10 (* (div (+ c_~s~0 (- 10)) 4294967296) 4294967296)) c_~s~0)) (.cse13 (+ c_~m~0 2)) (.cse6 (+ c_~m~0 9)) (.cse8 (+ c_~m~0 5)) (.cse4 (< 0 (mod c_~t~0 4294967296))) (.cse14 (+ c_~m~0 3)) (.cse17 (+ c_~m~0 4)) (.cse7 (and (< c_~m~0 (+ (* (div (+ c_~m~0 (- 4294967286)) 4294967296) 4294967296) .cse1 4294967287)) (< (+ (* 4294967296 (div .cse16 4294967296)) .cse1) .cse2))) (.cse15 (< (+ (* (div (+ c_~s~0 (- 9)) 4294967296) 4294967296) 9) c_~s~0)) (.cse3 (< 0 (mod (+ c_~t~0 4294967295) 4294967296)))) (and (or .cse0 (and (< (+ .cse1 (* (div .cse2 4294967296) 4294967296)) (+ c_~m~0 12)) (< c_~m~0 (+ .cse1 4294967286 (* 4294967296 (div (+ c_~m~0 (- 4294967285)) 4294967296))))) .cse3) (or .cse4 (and (< (+ .cse1 (* (div .cse5 4294967296) 4294967296)) .cse6) (< c_~m~0 (+ (* (div (+ c_~m~0 (- 4294967288)) 4294967296) 4294967296) .cse1 4294967289))) (< (+ (* (div (+ c_~s~0 (- 8)) 4294967296) 4294967296) 8) c_~s~0)) (or .cse0 .cse7 .cse3) (or .cse4 (< (+ 5 (* (div (+ c_~s~0 (- 5)) 4294967296) 4294967296)) c_~s~0) (and (< c_~m~0 (+ 4294967292 .cse1 (* (div (+ (- 4294967291) c_~m~0) 4294967296) 4294967296))) (< (+ (* (div .cse8 4294967296) 4294967296) .cse1) .cse9))) (or .cse4 (and (< c_~m~0 (+ 4294967291 .cse1 (* (div (+ (- 4294967290) c_~m~0) 4294967296) 4294967296))) (< (+ .cse1 (* (div .cse9 4294967296) 4294967296)) .cse10)) (< (+ (* (div (+ c_~s~0 (- 6)) 4294967296) 4294967296) 6) c_~s~0)) (or .cse4 (let ((.cse12 (+ c_~m~0 1))) (and (or (< 0 (mod c_~s~0 4294967296)) (let ((.cse11 (* (div c_~m~0 4294967296) 4294967296))) (and (< c_~m~0 (+ .cse1 .cse11 1)) (< (+ .cse1 .cse11) .cse12)))) (or (and (< c_~m~0 (+ .cse1 (* (div (+ c_~m~0 (- 4294967295)) 4294967296) 4294967296) 4294967296)) (< (+ .cse1 (* (div .cse12 4294967296) 4294967296)) .cse13)) (< (+ (* (div (+ c_~s~0 (- 1)) 4294967296) 4294967296) 1) c_~s~0))))) (or .cse4 (and (< c_~m~0 (+ 4294967290 .cse1 (* (div (+ (- 4294967289) c_~m~0) 4294967296) 4294967296))) (< (+ .cse1 (* (div .cse10 4294967296) 4294967296)) .cse5)) (< (+ 7 (* (div (+ c_~s~0 (- 7)) 4294967296) 4294967296)) c_~s~0)) (or .cse0 .cse4 .cse7) (or .cse4 (< (+ 2 (* (div (+ c_~s~0 (- 2)) 4294967296) 4294967296)) c_~s~0) (and (< c_~m~0 (+ .cse1 4294967295 (* 4294967296 (div (+ c_~m~0 (- 4294967294)) 4294967296)))) (< (+ .cse1 (* (div .cse13 4294967296) 4294967296)) .cse14))) (or .cse4 .cse15 (and (< c_~m~0 (+ (* (div (+ (- 4294967287) c_~m~0) 4294967296) 4294967296) 4294967288 .cse1)) (< (+ (* (div .cse6 4294967296) 4294967296) .cse1) .cse16))) (or .cse4 (and (< (+ (* (div .cse17 4294967296) 4294967296) .cse1) .cse8) (< c_~m~0 (+ .cse1 (* (div (+ (- 4294967292) c_~m~0) 4294967296) 4294967296) 4294967293))) (< (+ (* 4294967296 (div (+ c_~s~0 (- 4)) 4294967296)) 4) c_~s~0)) (or (= (mod c_~m~0 4294967296) .cse1) (not (<= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0))) (or .cse4 (and (< c_~m~0 (+ .cse1 4294967294 (* (div (+ c_~m~0 (- 4294967293)) 4294967296) 4294967296))) (< (+ (* (div .cse14 4294967296) 4294967296) .cse1) .cse17)) (< (+ (* (div (+ c_~s~0 (- 3)) 4294967296) 4294967296) 3) c_~s~0)) (or .cse7 .cse15 .cse3)))) is different from false [2023-05-04 03:26:44,669 WARN L233 SmtUtils]: Spent 14.52s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 03:28:06,256 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 03:28:06,256 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 03:28:06,287 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 03:28:07,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 03:28:07,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:28:07,208 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 148 known predicates. [2023-05-04 03:28:07,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 03:28:07,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 03:28:07,211 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 03:28:07,214 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-05-04 03:28:07,215 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 03:28:07,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 03:28:07,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 03:28:07 BasicIcfg [2023-05-04 03:28:07,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 03:28:07,236 INFO L158 Benchmark]: Toolchain (without parser) took 878251.36ms. Allocated memory was 196.1MB in the beginning and 444.6MB in the end (delta: 248.5MB). Free memory was 143.1MB in the beginning and 324.1MB in the end (delta: -181.0MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2023-05-04 03:28:07,236 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 03:28:07,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.52ms. Allocated memory is still 196.1MB. Free memory was 142.9MB in the beginning and 169.6MB in the end (delta: -26.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-05-04 03:28:07,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.87ms. Allocated memory is still 196.1MB. Free memory was 169.6MB in the beginning and 168.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 03:28:07,238 INFO L158 Benchmark]: Boogie Preprocessor took 16.99ms. Allocated memory is still 196.1MB. Free memory was 168.0MB in the beginning and 166.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 03:28:07,238 INFO L158 Benchmark]: RCFGBuilder took 381.00ms. Allocated memory is still 196.1MB. Free memory was 166.5MB in the beginning and 151.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-05-04 03:28:07,239 INFO L158 Benchmark]: TraceAbstraction took 877567.97ms. Allocated memory was 196.1MB in the beginning and 444.6MB in the end (delta: 248.5MB). Free memory was 150.5MB in the beginning and 324.1MB in the end (delta: -173.6MB). Peak memory consumption was 74.9MB. Max. memory is 8.0GB. [2023-05-04 03:28:07,240 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 196.1MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.52ms. Allocated memory is still 196.1MB. Free memory was 142.9MB in the beginning and 169.6MB in the end (delta: -26.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.87ms. Allocated memory is still 196.1MB. Free memory was 169.6MB in the beginning and 168.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.99ms. Allocated memory is still 196.1MB. Free memory was 168.0MB in the beginning and 166.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 381.00ms. Allocated memory is still 196.1MB. Free memory was 166.5MB in the beginning and 151.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 877567.97ms. Allocated memory was 196.1MB in the beginning and 444.6MB in the end (delta: 248.5MB). Free memory was 150.5MB in the beginning and 324.1MB in the end (delta: -173.6MB). Peak memory consumption was 74.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1317, independent: 1159, independent conditional: 744, independent unconditional: 415, dependent: 158, dependent conditional: 151, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 744, independent unconditional: 415, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 744, independent unconditional: 415, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 0, independent unconditional: 1159, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 0, independent unconditional: 1159, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 0, independent unconditional: 1159, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1166, independent: 764, independent conditional: 0, independent unconditional: 764, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 395, Positive conditional cache size: 0, Positive unconditional cache size: 395, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 151 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 72, Number of trivial persistent sets: 66, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 422, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1317, independent: 1159, independent conditional: 744, independent unconditional: 415, dependent: 158, dependent conditional: 151, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 744, independent unconditional: 415, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 744, independent unconditional: 415, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 0, independent unconditional: 1159, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 0, independent unconditional: 1159, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1166, independent: 1159, independent conditional: 0, independent unconditional: 1159, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1166, independent: 764, independent conditional: 0, independent unconditional: 764, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 395, Positive conditional cache size: 0, Positive unconditional cache size: 395, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 151 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 148 known predicates. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 148 known predicates. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 148 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 100 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 877.4s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 756.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 188, 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.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 118.2s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1029 ConstructedInterpolants, 0 QuantifiedInterpolants, 27620 SizeOfPredicates, 57 NumberOfNonLiveVariables, 701 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 1/661 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown