./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 559b036c 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/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7399a2144dae504b22d3bd9a68ebd91d200de1e145cd9c7db720353ffec7d306 --- Real Ultimate output --- This is Ultimate 0.2.3-?-559b036-m [2023-11-23 02:32:54,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 02:32:54,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-23 02:32:54,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 02:32:54,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 02:32:54,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 02:32:54,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 02:32:54,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 02:32:54,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 02:32:54,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 02:32:54,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 02:32:54,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 02:32:54,166 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 02:32:54,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 02:32:54,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 02:32:54,168 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 02:32:54,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 02:32:54,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 02:32:54,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 02:32:54,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 02:32:54,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 02:32:54,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 02:32:54,170 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 02:32:54,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 02:32:54,171 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 02:32:54,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 02:32:54,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 02:32:54,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 02:32:54,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 02:32:54,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 02:32:54,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 02:32:54,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 02:32:54,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 02:32:54,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 02:32:54,174 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-23 02:32:54,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 02:32:54,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 02:32:54,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-23 02:32:54,175 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 02:32:54,175 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-23 02:32:54,175 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-23 02:32:54,175 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7399a2144dae504b22d3bd9a68ebd91d200de1e145cd9c7db720353ffec7d306 [2023-11-23 02:32:54,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 02:32:54,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 02:32:54,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 02:32:54,421 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 02:32:54,423 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 02:32:54,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2023-11-23 02:32:55,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 02:32:56,002 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 02:32:56,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2023-11-23 02:32:56,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e0ffaed66/b66357f75c2d4f89b963e1ac68a3f024/FLAGafe2e1ceb [2023-11-23 02:32:56,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e0ffaed66/b66357f75c2d4f89b963e1ac68a3f024 [2023-11-23 02:32:56,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 02:32:56,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 02:32:56,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 02:32:56,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 02:32:56,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 02:32:56,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243a26c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56, skipping insertion in model container [2023-11-23 02:32:56,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 02:32:56,371 WARN L240 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-7.i[30243,30256] [2023-11-23 02:32:56,394 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 02:32:56,404 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 02:32:56,441 WARN L240 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-7.i[30243,30256] [2023-11-23 02:32:56,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 02:32:56,477 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 02:32:56,477 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 02:32:56,483 INFO L206 MainTranslator]: Completed translation [2023-11-23 02:32:56,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56 WrapperNode [2023-11-23 02:32:56,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 02:32:56,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 02:32:56,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 02:32:56,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 02:32:56,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,538 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2023-11-23 02:32:56,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 02:32:56,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 02:32:56,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 02:32:56,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 02:32:56,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 02:32:56,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 02:32:56,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 02:32:56,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 02:32:56,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (1/1) ... [2023-11-23 02:32:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 02:32:56,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 02:32:56,630 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) [2023-11-23 02:32:56,650 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 [2023-11-23 02:32:56,673 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-23 02:32:56,674 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-23 02:32:56,674 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-23 02:32:56,674 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-23 02:32:56,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 02:32:56,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 02:32:56,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 02:32:56,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 02:32:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 02:32:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 02:32:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 02:32:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 02:32:56,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 02:32:56,678 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 02:32:56,797 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 02:32:56,799 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 02:32:56,965 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 02:32:57,093 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 02:32:57,094 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 02:32:57,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:57 BoogieIcfgContainer [2023-11-23 02:32:57,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 02:32:57,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 02:32:57,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 02:32:57,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 02:32:57,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:32:56" (1/3) ... [2023-11-23 02:32:57,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61902935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:32:57, skipping insertion in model container [2023-11-23 02:32:57,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:56" (2/3) ... [2023-11-23 02:32:57,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61902935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:32:57, skipping insertion in model container [2023-11-23 02:32:57,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:57" (3/3) ... [2023-11-23 02:32:57,102 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2023-11-23 02:32:57,110 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 02:32:57,119 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 02:32:57,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 02:32:57,119 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 02:32:57,156 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 02:32:57,188 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 02:32:57,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-23 02:32:57,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 02:32:57,215 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) [2023-11-23 02:32:57,223 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 [2023-11-23 02:32:57,262 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-23 02:32:57,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-23 02:32:57,302 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@5e6553f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 02:32:57,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-23 02:32:57,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 02:32:57,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 02:32:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1154782991, now seen corresponding path program 1 times [2023-11-23 02:32:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 02:32:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054923516] [2023-11-23 02:32:57,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:32:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 02:32:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:32:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:57,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 02:32:57,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054923516] [2023-11-23 02:32:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054923516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 02:32:57,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 02:32:57,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 02:32:57,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736373440] [2023-11-23 02:32:57,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 02:32:57,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 02:32:57,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 02:32:57,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 02:32:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 02:32:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:32:57,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 02:32:57,853 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) [2023-11-23 02:32:57,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:32:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:32:57,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 02:32:57,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 02:32:57,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 02:32:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 448548510, now seen corresponding path program 1 times [2023-11-23 02:32:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 02:32:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220755521] [2023-11-23 02:32:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:32:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 02:32:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:32:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 02:32:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220755521] [2023-11-23 02:32:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220755521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 02:32:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479999419] [2023-11-23 02:32:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:32:58,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 02:32:58,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 02:32:58,097 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) [2023-11-23 02:32:58,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 02:32:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:32:58,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 02:32:58,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 02:32:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:58,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 02:32:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479999419] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 02:32:58,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 02:32:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-23 02:32:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652527838] [2023-11-23 02:32:58,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 02:32:58,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 02:32:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 02:32:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 02:32:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-23 02:32:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:32:58,323 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 02:32:58,324 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) [2023-11-23 02:32:58,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:32:58,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:32:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:32:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:32:58,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 02:32:58,607 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 [2023-11-23 02:32:58,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 02:32:58,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 02:32:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1903132337, now seen corresponding path program 2 times [2023-11-23 02:32:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 02:32:58,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705740866] [2023-11-23 02:32:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:32:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 02:32:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:32:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 02:32:58,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705740866] [2023-11-23 02:32:58,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705740866] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 02:32:58,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946327783] [2023-11-23 02:32:58,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 02:32:58,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 02:32:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 02:32:58,785 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) [2023-11-23 02:32:58,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 02:32:58,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 02:32:58,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 02:32:58,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 02:32:58,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 02:32:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:58,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 02:32:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946327783] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 02:32:59,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 02:32:59,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-23 02:32:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922457339] [2023-11-23 02:32:59,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 02:32:59,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 02:32:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 02:32:59,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 02:32:59,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-23 02:32:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:32:59,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 02:32:59,040 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) [2023-11-23 02:32:59,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:32:59,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:32:59,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:32:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:32:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:32:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 02:32:59,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 02:32:59,346 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 [2023-11-23 02:32:59,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 02:32:59,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 02:32:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1557716143, now seen corresponding path program 3 times [2023-11-23 02:32:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 02:32:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931024011] [2023-11-23 02:32:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:32:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 02:32:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:32:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:59,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 02:32:59,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931024011] [2023-11-23 02:32:59,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931024011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 02:32:59,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938068755] [2023-11-23 02:32:59,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 02:32:59,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 02:32:59,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 02:32:59,665 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) [2023-11-23 02:32:59,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 02:32:59,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-23 02:32:59,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 02:32:59,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 02:32:59,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 02:32:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:32:59,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 02:32:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938068755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 02:32:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 02:32:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2023-11-23 02:32:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623127436] [2023-11-23 02:32:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 02:32:59,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 02:32:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 02:32:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 02:32:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2023-11-23 02:32:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:32:59,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 02:32:59,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 02:32:59,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:32:59,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:32:59,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-23 02:32:59,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:33:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:33:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:33:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 02:33:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:00,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 02:33:00,314 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 [2023-11-23 02:33:00,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 02:33:00,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 02:33:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -940499299, now seen corresponding path program 1 times [2023-11-23 02:33:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 02:33:00,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582241214] [2023-11-23 02:33:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:33:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 02:33:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:33:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:33:00,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 02:33:00,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582241214] [2023-11-23 02:33:00,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582241214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 02:33:00,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553433403] [2023-11-23 02:33:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:33:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 02:33:00,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 02:33:00,510 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) [2023-11-23 02:33:00,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 02:33:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:33:00,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 02:33:00,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 02:33:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-23 02:33:00,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 02:33:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553433403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 02:33:00,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 02:33:00,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2023-11-23 02:33:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401966778] [2023-11-23 02:33:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 02:33:00,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 02:33:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 02:33:00,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 02:33:00,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2023-11-23 02:33:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:33:00,739 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 02:33:00,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 02:33:00,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:33:00,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:33:00,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-23 02:33:00,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:00,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:33:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:33:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:33:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 02:33:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:00,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 02:33:01,043 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 [2023-11-23 02:33:01,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 02:33:01,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 02:33:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1135551052, now seen corresponding path program 1 times [2023-11-23 02:33:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 02:33:01,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867026655] [2023-11-23 02:33:01,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:33:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 02:33:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:33:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:33:01,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 02:33:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867026655] [2023-11-23 02:33:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867026655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 02:33:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754500865] [2023-11-23 02:33:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:33:01,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 02:33:01,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-23 02:33:01,220 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) [2023-11-23 02:33:01,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 02:33:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 02:33:01,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 02:33:01,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 02:33:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:33:01,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 02:33:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 02:33:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754500865] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 02:33:01,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 02:33:01,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2023-11-23 02:33:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909971263] [2023-11-23 02:33:01,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 02:33:01,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 02:33:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 02:33:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 02:33:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2023-11-23 02:33:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:33:01,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-23 02:33:01,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 02:33:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:33:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:33:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-23 02:33:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-23 02:33:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 02:33:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 02:33:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 02:33:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 02:33:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 02:33:01,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 02:33:01,777 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 [2023-11-23 02:33:01,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-23 02:33:01,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 02:33:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -390052492, now seen corresponding path program 2 times [2023-11-23 02:33:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 02:33:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302526825] [2023-11-23 02:33:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 02:33:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 02:33:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 02:33:01,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 02:33:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 02:33:01,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 02:33:01,888 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 02:33:01,889 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-23 02:33:01,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-23 02:33:01,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-23 02:33:01,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 02:33:01,894 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2023-11-23 02:33:01,897 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 02:33:01,898 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 02:33:01,938 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2023-11-23 02:33:01,941 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-23 02:33:01,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:33:01 BasicIcfg [2023-11-23 02:33:01,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 02:33:01,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 02:33:01,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 02:33:01,968 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 02:33:01,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:57" (3/4) ... [2023-11-23 02:33:01,969 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 02:33:01,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2023-11-23 02:33:01,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-23 02:33:02,037 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2023-11-23 02:33:02,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 02:33:02,038 INFO L158 Benchmark]: Toolchain (without parser) took 6001.09ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 139.6MB in the beginning and 126.7MB in the end (delta: 12.8MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2023-11-23 02:33:02,038 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 02:33:02,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.99ms. Allocated memory is still 169.9MB. Free memory was 139.6MB in the beginning and 119.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-23 02:33:02,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 169.9MB. Free memory was 119.9MB in the beginning and 118.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 02:33:02,039 INFO L158 Benchmark]: Boogie Preprocessor took 41.98ms. Allocated memory is still 169.9MB. Free memory was 118.0MB in the beginning and 116.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 02:33:02,039 INFO L158 Benchmark]: RCFGBuilder took 509.92ms. Allocated memory is still 169.9MB. Free memory was 116.5MB in the beginning and 92.8MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 02:33:02,039 INFO L158 Benchmark]: TraceAbstraction took 4871.51ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 92.1MB in the beginning and 144.6MB in the end (delta: -52.4MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2023-11-23 02:33:02,040 INFO L158 Benchmark]: Witness Printer took 69.56ms. Allocated memory is still 205.5MB. Free memory was 144.6MB in the beginning and 126.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-23 02:33:02,041 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.99ms. Allocated memory is still 169.9MB. Free memory was 139.6MB in the beginning and 119.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 169.9MB. Free memory was 119.9MB in the beginning and 118.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.98ms. Allocated memory is still 169.9MB. Free memory was 118.0MB in the beginning and 116.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 509.92ms. Allocated memory is still 169.9MB. Free memory was 116.5MB in the beginning and 92.8MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4871.51ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 92.1MB in the beginning and 144.6MB in the end (delta: -52.4MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Witness Printer took 69.56ms. Allocated memory is still 205.5MB. Free memory was 144.6MB in the beginning and 126.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4142, independent: 3333, independent conditional: 3086, independent unconditional: 247, dependent: 809, dependent conditional: 802, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3340, independent: 3333, independent conditional: 3086, 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: 3340, independent: 3333, independent conditional: 3086, 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: 3340, independent: 3333, independent conditional: 0, independent unconditional: 3333, 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: 3340, independent: 3333, independent conditional: 0, independent unconditional: 3333, 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: 3340, independent: 3333, independent conditional: 0, independent unconditional: 3333, 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: 116, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3340, independent: 3102, independent conditional: 0, independent unconditional: 3102, 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: 802 - 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: 4142, independent: 3333, independent conditional: 3086, independent unconditional: 247, dependent: 809, dependent conditional: 802, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3340, independent: 3333, independent conditional: 3086, 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: 3340, independent: 3333, independent conditional: 3086, 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: 3340, independent: 3333, independent conditional: 0, independent unconditional: 3333, 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: 3340, independent: 3333, independent conditional: 0, independent unconditional: 3333, 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: 3340, independent: 3333, independent conditional: 0, independent unconditional: 3333, 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: 116, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3340, independent: 3102, independent conditional: 0, independent unconditional: 3102, 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: 802 - 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)=1598, argc=1598, argv={1599:1600}, cur=1, i=0, id1={3:0}, id2={5:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=1, id1={3:0}, id2={5:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=1, id1={3:0}, id2={5:0}, 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(argc)=1598, arg={0:0}, argc=1598, argv={1599:1600}, cur=1, i=1, id1={3:0}, id2={5:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [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(argc)=1598, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, cur=1, i=1, id1={3:0}, id2={5:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 7 VAL [arg={0:0}, 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 [arg={0:0}, 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 [arg={0:0}, 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 < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [arg={0:0}, 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 FALSE 1 !(p < 7) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 7) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=9] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=10] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=11] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=12] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=13] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=14] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=15] [L705] COND TRUE 0 x < 16 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L705] COND FALSE 0 !(x < 16) [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(argc)=1598, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, assert_cond=0, correct=987, cur=1597, i=610, id1={3:0}, id2={5:0}, j=987, next=1597, p=7, prev=987, q=7, x=16] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L681] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] - 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: 4.7s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.7s, 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: 59, 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.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 1965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1325 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 675/2166 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! [2023-11-23 02:33:02,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-11-23 02:33:02,283 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