./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i --full-output --validate ./goblint.2024-08-08_07-59-58.files/protection-local/fib_unsafe-12.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7bc0c755 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i ./goblint.2024-08-08_07-59-58.files/protection-local/fib_unsafe-12.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-validation-atomicfix-7bc0c75-m [2024-08-23 15:58:01,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-23 15:58:01,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-23 15:58:01,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-23 15:58:01,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-23 15:58:01,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-23 15:58:01,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-23 15:58:01,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-23 15:58:01,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-23 15:58:01,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-23 15:58:01,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-23 15:58:01,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-23 15:58:01,294 INFO L153 SettingsManager]: * Use SBE=true [2024-08-23 15:58:01,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-23 15:58:01,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-23 15:58:01,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-23 15:58:01,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-23 15:58:01,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-23 15:58:01,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-23 15:58:01,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-23 15:58:01,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-23 15:58:01,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-23 15:58:01,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-23 15:58:01,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-23 15:58:01,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-23 15:58:01,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-23 15:58:01,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-23 15:58:01,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-23 15:58:01,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-23 15:58:01,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-23 15:58:01,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-23 15:58:01,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-23 15:58:01,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-23 15:58:01,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-23 15:58:01,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-23 15:58:01,305 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-23 15:58:01,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-23 15:58:01,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-23 15:58:01,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-23 15:58:01,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-23 15:58:01,306 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-23 15:58:01,309 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-23 15:58:01,309 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2024-08-23 15:58:01,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-23 15:58:01,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-23 15:58:01,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-23 15:58:01,674 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-23 15:58:01,677 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-23 15:58:01,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-local/fib_unsafe-12.yml/witness.yml [2024-08-23 15:58:01,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-23 15:58:01,814 INFO L274 PluginConnector]: CDTParser initialized [2024-08-23 15:58:01,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i [2024-08-23 15:58:03,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-23 15:58:03,614 INFO L384 CDTParser]: Found 1 translation units. [2024-08-23 15:58:03,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i [2024-08-23 15:58:03,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/12b4a8fda/0861e66a498c4c8ebbc636fe71f49a08/FLAGc8d907afc [2024-08-23 15:58:03,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/12b4a8fda/0861e66a498c4c8ebbc636fe71f49a08 [2024-08-23 15:58:03,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-23 15:58:03,922 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-23 15:58:03,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-23 15:58:03,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-23 15:58:03,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-23 15:58:03,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 03:58:01" (1/2) ... [2024-08-23 15:58:03,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66216ccf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 03:58:03, skipping insertion in model container [2024-08-23 15:58:03,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 03:58:01" (1/2) ... [2024-08-23 15:58:03,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42f191a8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 03:58:03, skipping insertion in model container [2024-08-23 15:58:03,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 03:58:03" (2/2) ... [2024-08-23 15:58:03,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66216ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:03, skipping insertion in model container [2024-08-23 15:58:03,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 03:58:03" (2/2) ... [2024-08-23 15:58:03,942 INFO L81 nessWitnessExtractor]: Only extracting loop invariants from correctness witness [2024-08-23 15:58:03,946 INFO L92 edCorrectnessWitness]: Witness did not contain any usable entries. [2024-08-23 15:58:03,997 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-23 15:58:04,385 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2024-08-23 15:58:04,410 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-23 15:58:04,422 INFO L202 MainTranslator]: Completed pre-run [2024-08-23 15:58:04,473 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2024-08-23 15:58:04,485 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-23 15:58:04,524 INFO L206 MainTranslator]: Completed translation [2024-08-23 15:58:04,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04 WrapperNode [2024-08-23 15:58:04,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-23 15:58:04,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-23 15:58:04,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-23 15:58:04,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-23 15:58:04,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,576 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-08-23 15:58:04,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-23 15:58:04,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-23 15:58:04,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-23 15:58:04,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-23 15:58:04,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-23 15:58:04,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-23 15:58:04,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-23 15:58:04,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-23 15:58:04,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (1/1) ... [2024-08-23 15:58:04,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-23 15:58:04,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:04,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-23 15:58:04,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-23 15:58:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-08-23 15:58:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-08-23 15:58:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-08-23 15:58:04,720 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-08-23 15:58:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-23 15:58:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-23 15:58:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-23 15:58:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-23 15:58:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-23 15:58:04,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-23 15:58:04,738 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-23 15:58:04,872 INFO L243 CfgBuilder]: Building ICFG [2024-08-23 15:58:04,876 INFO L269 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-23 15:58:05,022 INFO L288 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-23 15:58:05,022 INFO L292 CfgBuilder]: Performing block encoding [2024-08-23 15:58:05,144 INFO L314 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-23 15:58:05,145 INFO L319 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-23 15:58:05,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 03:58:05 BoogieIcfgContainer [2024-08-23 15:58:05,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-23 15:58:05,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-23 15:58:05,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-23 15:58:05,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-23 15:58:05,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 03:58:01" (1/4) ... [2024-08-23 15:58:05,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca47fe3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.08 03:58:05, skipping insertion in model container [2024-08-23 15:58:05,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 03:58:03" (2/4) ... [2024-08-23 15:58:05,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca47fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 03:58:05, skipping insertion in model container [2024-08-23 15:58:05,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 03:58:04" (3/4) ... [2024-08-23 15:58:05,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca47fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 03:58:05, skipping insertion in model container [2024-08-23 15:58:05,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 03:58:05" (4/4) ... [2024-08-23 15:58:05,159 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i [2024-08-23 15:58:05,175 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-23 15:58:05,175 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-23 15:58:05,175 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-23 15:58:05,219 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-23 15:58:05,267 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 15:58:05,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 15:58:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:05,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-23 15:58:05,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-23 15:58:05,323 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 15:58:05,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-23 15:58:05,345 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1c6b1875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 15:58:05,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-23 15:58:05,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:05,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1703157173, now seen corresponding path program 1 times [2024-08-23 15:58:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:05,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113053557] [2024-08-23 15:58:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 15:58:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113053557] [2024-08-23 15:58:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113053557] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 15:58:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 15:58:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-23 15:58:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271710610] [2024-08-23 15:58:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 15:58:05,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 15:58:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 15:58:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 15:58:05,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 15:58:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:05,808 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 15:58:05,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-08-23 15:58:05,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-23 15:58:05,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:05,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 311074172, now seen corresponding path program 1 times [2024-08-23 15:58:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917041447] [2024-08-23 15:58:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 15:58:06,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917041447] [2024-08-23 15:58:06,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917041447] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 15:58:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102510536] [2024-08-23 15:58:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:06,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:06,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:06,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 15:58:06,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-23 15:58:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:06,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-23 15:58:06,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 15:58:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:06,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 15:58:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102510536] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 15:58:06,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 15:58:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-08-23 15:58:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123099417] [2024-08-23 15:58:06,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 15:58:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-23 15:58:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 15:58:06,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-23 15:58:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-08-23 15:58:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:06,321 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 15:58:06,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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) [2024-08-23 15:58:06,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:06,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:06,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-23 15:58:06,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-08-23 15:58:06,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:06,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1499777035, now seen corresponding path program 2 times [2024-08-23 15:58:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359659563] [2024-08-23 15:58:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:06,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 15:58:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359659563] [2024-08-23 15:58:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359659563] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 15:58:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134073973] [2024-08-23 15:58:06,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 15:58:06,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:06,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:06,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 15:58:06,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-23 15:58:06,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-23 15:58:06,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 15:58:06,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-23 15:58:06,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 15:58:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:07,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 15:58:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134073973] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 15:58:07,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 15:58:07,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-08-23 15:58:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001453599] [2024-08-23 15:58:07,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 15:58:07,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-23 15:58:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 15:58:07,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-23 15:58:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-08-23 15:58:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:07,190 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 15:58:07,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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) [2024-08-23 15:58:07,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:07,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:07,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:07,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-23 15:58:07,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:07,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:07,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1238457173, now seen corresponding path program 3 times [2024-08-23 15:58:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:07,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493245766] [2024-08-23 15:58:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 15:58:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493245766] [2024-08-23 15:58:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493245766] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 15:58:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200492837] [2024-08-23 15:58:07,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-23 15:58:07,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:07,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:07,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 15:58:07,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-23 15:58:07,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-08-23 15:58:07,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 15:58:07,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-23 15:58:07,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 15:58:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:08,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 15:58:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200492837] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 15:58:08,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 15:58:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-08-23 15:58:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400024127] [2024-08-23 15:58:08,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 15:58:08,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-23 15:58:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 15:58:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-23 15:58:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-08-23 15:58:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:08,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 15:58:08,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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) [2024-08-23 15:58:08,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:08,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:08,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:08,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 15:58:08,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-23 15:58:08,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:08,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:08,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 66258411, now seen corresponding path program 4 times [2024-08-23 15:58:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54107437] [2024-08-23 15:58:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 15:58:09,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54107437] [2024-08-23 15:58:09,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54107437] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 15:58:09,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842194464] [2024-08-23 15:58:09,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-23 15:58:09,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:09,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:09,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 15:58:09,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-23 15:58:09,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-23 15:58:09,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 15:58:09,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-23 15:58:09,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 15:58:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 1396 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-08-23 15:58:10,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 15:58:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842194464] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 15:58:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 15:58:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [25] total 38 [2024-08-23 15:58:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824262235] [2024-08-23 15:58:10,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 15:58:10,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-23 15:58:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 15:58:10,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-23 15:58:10,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406 [2024-08-23 15:58:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:10,256 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 15:58:10,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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) [2024-08-23 15:58:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-23 15:58:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 15:58:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:10,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-23 15:58:10,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:10,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:10,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1482468547, now seen corresponding path program 1 times [2024-08-23 15:58:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:10,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442827001] [2024-08-23 15:58:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 0 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:11,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 15:58:11,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442827001] [2024-08-23 15:58:11,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442827001] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 15:58:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735694162] [2024-08-23 15:58:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:11,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:11,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 15:58:11,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-23 15:58:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:11,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-23 15:58:11,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 15:58:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-08-23 15:58:11,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 15:58:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735694162] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 15:58:11,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 15:58:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [25] total 38 [2024-08-23 15:58:11,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961866605] [2024-08-23 15:58:11,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 15:58:11,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-23 15:58:11,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 15:58:11,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-23 15:58:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406 [2024-08-23 15:58:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:11,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 15:58:11,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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) [2024-08-23 15:58:11,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:11,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:11,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:11,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-23 15:58:11,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:11,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 15:58:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:12,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-23 15:58:12,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:12,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:12,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash -910794965, now seen corresponding path program 1 times [2024-08-23 15:58:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:12,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076687901] [2024-08-23 15:58:12,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:12,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 15:58:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076687901] [2024-08-23 15:58:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076687901] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 15:58:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915320132] [2024-08-23 15:58:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 15:58:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 15:58:12,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 15:58:12,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-23 15:58:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 15:58:12,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 24 conjunts are in the unsatisfiable core [2024-08-23 15:58:12,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 15:58:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:13,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 15:58:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 15:58:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915320132] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 15:58:13,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 15:58:13,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 29 [2024-08-23 15:58:13,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27840652] [2024-08-23 15:58:13,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 15:58:13,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-23 15:58:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 15:58:13,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-23 15:58:13,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2024-08-23 15:58:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:13,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 15:58:13,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 29 states have internal predecessors, (144), 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) [2024-08-23 15:58:13,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:13,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:13,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:13,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-23 15:58:13,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:13,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:13,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 15:58:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 15:58:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 15:58:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-23 15:58:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 15:58:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 15:58:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-23 15:58:13,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-23 15:58:13,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-08-23 15:58:13,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 15:58:13,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 15:58:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -550847317, now seen corresponding path program 2 times [2024-08-23 15:58:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 15:58:13,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643593407] [2024-08-23 15:58:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 15:58:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 15:58:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 15:58:13,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-23 15:58:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 15:58:14,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-23 15:58:14,056 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-23 15:58:14,057 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-08-23 15:58:14,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-08-23 15:58:14,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-08-23 15:58:14,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-23 15:58:14,066 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2024-08-23 15:58:14,072 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-23 15:58:14,072 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-23 15:58:14,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 03:58:14 BasicIcfg [2024-08-23 15:58:14,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-23 15:58:14,216 INFO L158 Benchmark]: Toolchain (without parser) took 10293.95ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 113.4MB in the beginning and 200.7MB in the end (delta: -87.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-08-23 15:58:14,216 INFO L158 Benchmark]: Witness Parser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-23 15:58:14,216 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-23 15:58:14,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.62ms. Allocated memory is still 201.3MB. Free memory was 113.1MB in the beginning and 154.5MB in the end (delta: -41.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-08-23 15:58:14,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.51ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 152.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-23 15:58:14,217 INFO L158 Benchmark]: Boogie Preprocessor took 30.75ms. Allocated memory is still 201.3MB. Free memory was 152.2MB in the beginning and 150.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-23 15:58:14,217 INFO L158 Benchmark]: RCFGBuilder took 538.68ms. Allocated memory is still 201.3MB. Free memory was 150.3MB in the beginning and 149.6MB in the end (delta: 747.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-08-23 15:58:14,218 INFO L158 Benchmark]: TraceAbstraction took 9065.50ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 149.6MB in the beginning and 200.7MB in the end (delta: -51.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-08-23 15:58:14,219 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.62ms. Allocated memory is still 201.3MB. Free memory was 113.1MB in the beginning and 154.5MB in the end (delta: -41.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.51ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 152.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.75ms. Allocated memory is still 201.3MB. Free memory was 152.2MB in the beginning and 150.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 538.68ms. Allocated memory is still 201.3MB. Free memory was 150.3MB in the beginning and 149.6MB in the end (delta: 747.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9065.50ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 149.6MB in the beginning and 200.7MB in the end (delta: -51.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5865, independent: 4923, independent conditional: 4676, independent unconditional: 247, dependent: 942, dependent conditional: 935, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4930, independent: 4923, independent conditional: 4676, independent unconditional: 247, 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: 4930, independent: 4923, independent conditional: 4676, independent unconditional: 247, 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: 4930, independent: 4923, independent conditional: 0, independent unconditional: 4923, 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: 4930, independent: 4923, independent conditional: 0, independent unconditional: 4923, 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: 4930, independent: 4923, independent conditional: 0, independent unconditional: 4923, 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: 238, independent: 231, independent conditional: 0, independent unconditional: 231, 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: 238, independent: 230, independent conditional: 0, independent unconditional: 230, 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: 64, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4930, independent: 4692, independent conditional: 0, independent unconditional: 4692, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, 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: 935 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 34, Number of trivial persistent sets: 20, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 247, independent conditional: 0, independent unconditional: 247, 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: 5865, independent: 4923, independent conditional: 4676, independent unconditional: 247, dependent: 942, dependent conditional: 935, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4930, independent: 4923, independent conditional: 4676, independent unconditional: 247, 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: 4930, independent: 4923, independent conditional: 4676, independent unconditional: 247, 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: 4930, independent: 4923, independent conditional: 0, independent unconditional: 4923, 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: 4930, independent: 4923, independent conditional: 0, independent unconditional: 4923, 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: 4930, independent: 4923, independent conditional: 0, independent unconditional: 4923, 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: 238, independent: 231, independent conditional: 0, independent unconditional: 231, 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: 238, independent: 230, independent conditional: 0, independent unconditional: 230, 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: 64, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4930, independent: 4692, independent conditional: 0, independent unconditional: 4692, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 238, unknown conditional: 0, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, 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: 935 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; [L685] 0 int p, q; [L702] 0 int cur = 1, prev = 0, next = 0; [L703] 0 int x; [L713] 0 pthread_t id1, id2; VAL [\old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196419, \old(argv)={196420:196421}, arg={0:0}, argc=196419, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=6, x=6] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=7, x=7] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=8, x=7] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=8, x=8] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=9, x=8] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=9, x=9] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=10, x=9] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=10, x=10] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=11, x=10] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L687] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L689] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=46368, next=144, p=11, prev=89, q=11, x=11] [L687] 1 p++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=46368, next=144, p=12, prev=89, q=11, x=11] [L695] COND TRUE 2 q < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=46368, next=144, p=12, prev=89, q=11, x=11] [L697] 2 j = j + i VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=121393, next=144, p=12, prev=89, q=11, x=11] [L695] 2 q++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=121393, next=144, p=12, prev=89, q=12, x=11] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=121393, next=233, p=12, prev=144, q=12, x=12] [L687] COND FALSE 1 !(p < 12) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 12) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, i=75025, j=121393, next=610, p=12, prev=377, q=12, x=14] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=987, i=75025, j=121393, next=987, p=12, prev=610, q=12, x=15] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=75025, j=121393, next=1597, p=12, prev=987, q=12, x=16] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=75025, j=121393, next=2584, p=12, prev=1597, q=12, x=17] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=75025, j=121393, next=4181, p=12, prev=2584, q=12, x=18] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=75025, j=121393, next=6765, p=12, prev=4181, q=12, x=19] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=75025, j=121393, next=10946, p=12, prev=6765, q=12, x=20] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=75025, j=121393, next=17711, p=12, prev=10946, q=12, x=21] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=75025, j=121393, next=28657, p=12, prev=17711, q=12, x=22] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=75025, j=121393, next=46368, p=12, prev=28657, q=12, x=23] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=75025, j=121393, next=75025, p=12, prev=46368, q=12, x=24] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=75025, j=121393, next=121393, p=12, prev=75025, q=12, x=25] [L705] COND TRUE 0 x < 26 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L705] COND FALSE 0 !(x < 26) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196419, \old(argv)={196420:196421}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=196419, assert_cond=0, correct=121393, cur=196418, i=75025, id1=-2, id2=-1, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=196418, expression=0, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L681] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=196418, expression=0, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.3s, 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: 103, 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, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1330 NumberOfCodeBlocks, 1330 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1477 ConstructedInterpolants, 0 QuantifiedInterpolants, 3761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2079 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 2993/9391 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 proved your program to be incorrect! [2024-08-23 15:58:14,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-08-23 15:58:14,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE