./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-12.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-12.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX --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 0d5255e9cc8ffb776115e75fa8fa1fa6c2774a79275dfd8235c357288b00417c
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-05 09:22:47,803 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-05 09:22:47,862 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-12-05 09:22:47,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-05 09:22:47,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-05 09:22:47,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-05 09:22:47,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-05 09:22:47,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-05 09:22:47,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-05 09:22:47,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-05 09:22:47,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-05 09:22:47,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-05 09:22:47,889 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-05 09:22:47,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-05 09:22:47,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-12-05 09:22:47,889 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-05 09:22:47,890 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-05 09:22:47,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-12-05 09:22:47,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT
[2024-12-05 09:22:47,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-12-05 09:22:47,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX
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 -> 0d5255e9cc8ffb776115e75fa8fa1fa6c2774a79275dfd8235c357288b00417c
[2024-12-05 09:22:48,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-05 09:22:48,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-05 09:22:48,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-05 09:22:48,125 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-05 09:22:48,126 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-05 09:22:48,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/../../sv-benchmarks/c/pthread/fib_unsafe-12.i
[2024-12-05 09:22:50,821 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/data/ce20a6cc3/20237dafc07e419dab338815b905a548/FLAGd19f61cfe
[2024-12-05 09:22:51,067 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-05 09:22:51,067 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/sv-benchmarks/c/pthread/fib_unsafe-12.i
[2024-12-05 09:22:51,079 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/data/ce20a6cc3/20237dafc07e419dab338815b905a548/FLAGd19f61cfe
[2024-12-05 09:22:51,404 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/data/ce20a6cc3/20237dafc07e419dab338815b905a548
[2024-12-05 09:22:51,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-05 09:22:51,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-05 09:22:51,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-05 09:22:51,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-05 09:22:51,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-05 09:22:51,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be622c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51, skipping insertion in model container
[2024-12-05 09:22:51,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,435 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-05 09:22:51,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/sv-benchmarks/c/pthread/fib_unsafe-12.i[30243,30256]
[2024-12-05 09:22:51,675 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-05 09:22:51,684 INFO L200 MainTranslator]: Completed pre-run
[2024-12-05 09:22:51,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/sv-benchmarks/c/pthread/fib_unsafe-12.i[30243,30256]
[2024-12-05 09:22:51,719 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-05 09:22:51,750 INFO L204 MainTranslator]: Completed translation
[2024-12-05 09:22:51,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51 WrapperNode
[2024-12-05 09:22:51,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-05 09:22:51,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-05 09:22:51,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-05 09:22:51,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-05 09:22:51,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,776 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65
[2024-12-05 09:22:51,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-05 09:22:51,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-05 09:22:51,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-05 09:22:51,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-05 09:22:51,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-05 09:22:51,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-05 09:22:51,792 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-05 09:22:51,792 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-05 09:22:51,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (1/1) ...
[2024-12-05 09:22:51,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-12-05 09:22:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3
[2024-12-05 09:22:51,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-12-05 09:22:51,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-12-05 09:22:51,841 INFO L130 BoogieDeclarations]: Found specification of procedure t1
[2024-12-05 09:22:51,841 INFO L138 BoogieDeclarations]: Found implementation of procedure t1
[2024-12-05 09:22:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure t2
[2024-12-05 09:22:51,842 INFO L138 BoogieDeclarations]: Found implementation of procedure t2
[2024-12-05 09:22:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-05 09:22:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-05 09:22:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-12-05 09:22:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-05 09:22:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-05 09:22:51,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-05 09:22:51,843 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-05 09:22:51,933 INFO L234 CfgBuilder]: Building ICFG
[2024-12-05 09:22:51,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-05 09:22:52,059 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-05 09:22:52,059 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-05 09:22:52,145 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-05 09:22:52,145 INFO L312 CfgBuilder]: Removed 3 assume(true) statements.
[2024-12-05 09:22:52,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:22:52 BoogieIcfgContainer
[2024-12-05 09:22:52,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-05 09:22:52,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-05 09:22:52,148 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-05 09:22:52,152 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-05 09:22:52,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:22:51" (1/3) ...
[2024-12-05 09:22:52,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac30bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:22:52, skipping insertion in model container
[2024-12-05 09:22:52,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:22:51" (2/3) ...
[2024-12-05 09:22:52,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac30bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:22:52, skipping insertion in model container
[2024-12-05 09:22:52,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:22:52" (3/3) ...
[2024-12-05 09:22:52,155 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i
[2024-12-05 09:22:52,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-05 09:22:52,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-12.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations.
[2024-12-05 09:22:52,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-05 09:22:52,212 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-05 09:22:52,261 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-05 09:22:52,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-12-05 09:22:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3
[2024-12-05 09:22:52,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-12-05 09:22:52,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-12-05 09:22:52,323 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-12-05 09:22:52,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-12-05 09:22:52,344 INFO L333 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, 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;@dcc467c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-05 09:22:52,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations.
[2024-12-05 09:22:52,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:22:52,688 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:22:52,688 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #1
[2024-12-05 09:22:52,688 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping...
[2024-12-05 09:22:52,688 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:22:52,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:22:52,693 INFO L85 PathProgramCache]: Analyzing trace with hash 613904055, now seen corresponding path program 1 times
[2024-12-05 09:22:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:22:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284822428]
[2024-12-05 09:22:52,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-05 09:22:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:22:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-05 09:22:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:52,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-05 09:22:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284822428]
[2024-12-05 09:22:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284822428] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-05 09:22:52,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-05 09:22:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-05 09:22:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301692576]
[2024-12-05 09:22:52,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-05 09:22:52,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-05 09:22:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-05 09:22:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-05 09:22:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-05 09:22:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:52,951 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-12-05 09:22:52,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-05 09:22:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:53,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-05 09:22:53,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:22:53,014 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:22:53,015 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #2
[2024-12-05 09:22:53,015 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition.
[2024-12-05 09:22:53,015 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0
[2024-12-05 09:22:53,015 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,016 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2
[2024-12-05 09:22:53,016 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,016 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4
[2024-12-05 09:22:53,032 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:53,033 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7
[2024-12-05 09:22:53,033 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:53,033 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24
[2024-12-05 09:22:53,033 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,033 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26
[2024-12-05 09:22:53,033 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,033 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition.
[2024-12-05 09:22:53,033 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:22:53,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:22:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash 896195671, now seen corresponding path program 1 times
[2024-12-05 09:22:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:22:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518714404]
[2024-12-05 09:22:53,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-05 09:22:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:22:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-05 09:22:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:53,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-05 09:22:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518714404]
[2024-12-05 09:22:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518714404] provided 0 perfect and 1 imperfect interpolant sequences
[2024-12-05 09:22:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755706437]
[2024-12-05 09:22:53,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-05 09:22:53,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:53,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3
[2024-12-05 09:22:53,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-05 09:22:53,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-12-05 09:22:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-05 09:22:53,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-12-05 09:22:53,233 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-05 09:22:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:53,283 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-12-05 09:22:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755706437] provided 0 perfect and 2 imperfect interpolant sequences
[2024-12-05 09:22:53,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-12-05 09:22:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2024-12-05 09:22:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139445032]
[2024-12-05 09:22:53,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-12-05 09:22:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-12-05 09:22:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-05 09:22:53,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-12-05 09:22:53,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-12-05 09:22:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:53,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-12-05 09:22:53,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-05 09:22:53,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:53,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:53,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-12-05 09:22:53,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:53,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:22:53,613 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:22:53,613 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #3
[2024-12-05 09:22:53,613 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition.
[2024-12-05 09:22:53,613 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0
[2024-12-05 09:22:53,613 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,613 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2
[2024-12-05 09:22:53,613 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,613 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4
[2024-12-05 09:22:53,613 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:53,614 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7
[2024-12-05 09:22:53,614 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:53,614 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45
[2024-12-05 09:22:53,614 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,614 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 47
[2024-12-05 09:22:53,614 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:53,614 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition.
[2024-12-05 09:22:53,614 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:22:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:22:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -333887817, now seen corresponding path program 2 times
[2024-12-05 09:22:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:22:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881328507]
[2024-12-05 09:22:53,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-05 09:22:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:22:53,647 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-12-05 09:22:53,647 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-05 09:22:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:53,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-05 09:22:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881328507]
[2024-12-05 09:22:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881328507] provided 0 perfect and 1 imperfect interpolant sequences
[2024-12-05 09:22:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150375470]
[2024-12-05 09:22:53,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-05 09:22:53,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3
[2024-12-05 09:22:53,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-05 09:22:53,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-12-05 09:22:53,877 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-12-05 09:22:53,877 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-05 09:22:53,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-12-05 09:22:53,881 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-05 09:22:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:53,951 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-12-05 09:22:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150375470] provided 0 perfect and 2 imperfect interpolant sequences
[2024-12-05 09:22:54,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-12-05 09:22:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13
[2024-12-05 09:22:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766086599]
[2024-12-05 09:22:54,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-12-05 09:22:54,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-12-05 09:22:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-05 09:22:54,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-12-05 09:22:54,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2024-12-05 09:22:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:54,062 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-12-05 09:22:54,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-05 09:22:54,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:54,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:54,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:54,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-12-05 09:22:54,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:54,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:22:54,438 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:22:54,439 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #4
[2024-12-05 09:22:54,439 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition.
[2024-12-05 09:22:54,439 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0
[2024-12-05 09:22:54,439 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:54,439 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2
[2024-12-05 09:22:54,439 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:54,440 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4
[2024-12-05 09:22:54,440 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:54,440 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7
[2024-12-05 09:22:54,440 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:54,441 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87
[2024-12-05 09:22:54,441 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:54,441 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89
[2024-12-05 09:22:54,442 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:54,442 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition.
[2024-12-05 09:22:54,442 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:22:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:22:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash 757762743, now seen corresponding path program 3 times
[2024-12-05 09:22:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:22:54,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968562610]
[2024-12-05 09:22:54,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-05 09:22:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:22:54,657 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2024-12-05 09:22:54,658 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-05 09:22:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:54,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-05 09:22:54,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968562610]
[2024-12-05 09:22:54,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968562610] provided 0 perfect and 1 imperfect interpolant sequences
[2024-12-05 09:22:54,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344987934]
[2024-12-05 09:22:54,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-05 09:22:54,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:54,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3
[2024-12-05 09:22:54,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-05 09:22:54,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-12-05 09:22:55,010 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2024-12-05 09:22:55,010 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-05 09:22:55,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-12-05 09:22:55,014 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-05 09:22:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:55,131 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-12-05 09:22:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:55,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344987934] provided 0 perfect and 2 imperfect interpolant sequences
[2024-12-05 09:22:55,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-12-05 09:22:55,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25
[2024-12-05 09:22:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914288455]
[2024-12-05 09:22:55,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-12-05 09:22:55,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-12-05 09:22:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-05 09:22:55,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-12-05 09:22:55,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600
[2024-12-05 09:22:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:55,414 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-12-05 09:22:55,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-05 09:22:55,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:55,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:55,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:55,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2024-12-05 09:22:55,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-12-05 09:22:55,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:55,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:22:55,869 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:22:55,869 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #5
[2024-12-05 09:22:55,869 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition.
[2024-12-05 09:22:55,869 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0
[2024-12-05 09:22:55,869 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:55,870 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2
[2024-12-05 09:22:55,870 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:55,870 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4
[2024-12-05 09:22:55,870 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:55,870 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7
[2024-12-05 09:22:55,870 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:22:55,870 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 171
[2024-12-05 09:22:55,870 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:55,870 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 173
[2024-12-05 09:22:55,870 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:22:55,870 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition.
[2024-12-05 09:22:55,870 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:22:55,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:22:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1106373961, now seen corresponding path program 4 times
[2024-12-05 09:22:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:22:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345352803]
[2024-12-05 09:22:55,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-12-05 09:22:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:22:55,943 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-12-05 09:22:55,944 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-05 09:22:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked.
[2024-12-05 09:22:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-05 09:22:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345352803]
[2024-12-05 09:22:56,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345352803] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-05 09:22:56,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-05 09:22:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2024-12-05 09:22:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218764904]
[2024-12-05 09:22:56,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-05 09:22:56,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-12-05 09:22:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-05 09:22:56,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-12-05 09:22:56,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380
[2024-12-05 09:22:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:56,667 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-12-05 09:22:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-05 09:22:56,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:56,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:56,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:56,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states.
[2024-12-05 09:22:56,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2024-12-05 09:22:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:22:57,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-05 09:22:57,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:22:57,029 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:22:57,029 INFO L139 ounterexampleChecker]: Examining path program with hash -1095916813, occurence #1
[2024-12-05 09:22:57,029 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping...
[2024-12-05 09:22:57,029 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:22:57,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:22:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1919196587, now seen corresponding path program 1 times
[2024-12-05 09:22:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:22:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729948454]
[2024-12-05 09:22:57,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-05 09:22:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:22:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-05 09:22:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-05 09:22:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729948454]
[2024-12-05 09:22:57,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729948454] provided 0 perfect and 1 imperfect interpolant sequences
[2024-12-05 09:22:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549324612]
[2024-12-05 09:22:57,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-05 09:22:57,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:57,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3
[2024-12-05 09:22:57,918 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-05 09:22:57,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-12-05 09:22:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-05 09:22:58,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-12-05 09:22:58,046 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-05 09:22:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked.
[2024-12-05 09:22:58,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-12-05 09:22:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549324612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-05 09:22:58,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-12-05 09:22:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [25] total 38
[2024-12-05 09:22:58,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928624411]
[2024-12-05 09:22:58,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-05 09:22:58,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-12-05 09:22:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-05 09:22:58,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-12-05 09:22:58,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406
[2024-12-05 09:22:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:58,417 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-12-05 09:22:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-05 09:22:58,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:58,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:58,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:58,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states.
[2024-12-05 09:22:58,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:22:58,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2024-12-05 09:22:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:22:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:22:58,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-12-05 09:22:58,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2024-12-05 09:22:58,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:22:58,815 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:22:58,815 INFO L139 ounterexampleChecker]: Examining path program with hash -1494760803, occurence #1
[2024-12-05 09:22:58,815 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping...
[2024-12-05 09:22:58,815 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:22:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:22:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash -690044745, now seen corresponding path program 1 times
[2024-12-05 09:22:58,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:22:58,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205259411]
[2024-12-05 09:22:58,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-05 09:22:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:22:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-05 09:22:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-05 09:22:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205259411]
[2024-12-05 09:22:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205259411] provided 0 perfect and 1 imperfect interpolant sequences
[2024-12-05 09:22:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007683879]
[2024-12-05 09:22:59,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-05 09:22:59,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-12-05 09:22:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3
[2024-12-05 09:22:59,374 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-12-05 09:22:59,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-12-05 09:22:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-05 09:22:59,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-12-05 09:22:59,479 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-12-05 09:22:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:59,600 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-12-05 09:22:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-05 09:22:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007683879] provided 0 perfect and 2 imperfect interpolant sequences
[2024-12-05 09:22:59,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-12-05 09:22:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 29
[2024-12-05 09:22:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523302134]
[2024-12-05 09:22:59,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-12-05 09:22:59,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-12-05 09:22:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-05 09:22:59,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-12-05 09:22:59,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812
[2024-12-05 09:22:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:22:59,927 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-12-05 09:22:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 29 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-05 09:22:59,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:22:59,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:22:59,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:22:59,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states.
[2024-12-05 09:22:59,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:22:59,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:22:59,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-12-05 09:23:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-05 09:23:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-05 09:23:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-12-05 09:23:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2024-12-05 09:23:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:23:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-12-05 09:23:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2024-12-05 09:23:00,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-12-05 09:23:00,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2024-12-05 09:23:00,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-12-05 09:23:00,250 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis.
[2024-12-05 09:23:00,250 INFO L139 ounterexampleChecker]: Examining path program with hash -1494760803, occurence #2
[2024-12-05 09:23:00,250 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition.
[2024-12-05 09:23:00,250 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0
[2024-12-05 09:23:00,250 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:23:00,250 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2
[2024-12-05 09:23:00,250 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:23:00,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4
[2024-12-05 09:23:00,251 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:23:00,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7
[2024-12-05 09:23:00,251 WARN L190 ounterexampleChecker]: Statements were already independent.
[2024-12-05 09:23:00,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 111
[2024-12-05 09:23:00,251 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:23:00,251 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 113
[2024-12-05 09:23:00,251 INFO L209 ounterexampleChecker]: No commutativity condition found.
[2024-12-05 09:23:00,251 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition.
[2024-12-05 09:23:00,251 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check.
[2024-12-05 09:23:00,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-05 09:23:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1256612343, now seen corresponding path program 2 times
[2024-12-05 09:23:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-05 09:23:00,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889289185]
[2024-12-05 09:23:00,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-05 09:23:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-05 09:23:00,300 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-12-05 09:23:00,300 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-05 09:23:00,300 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-05 09:23:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-05 09:23:00,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-12-05 09:23:00,399 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-05 09:23:00,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining)
[2024-12-05 09:23:00,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining)
[2024-12-05 09:23:00,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining)
[2024-12-05 09:23:00,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-12-05 09:23:00,406 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1]
[2024-12-05 09:23:00,508 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-05 09:23:00,508 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-05 09:23:00,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0
[2024-12-05 09:23:00,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:23:00 BasicIcfg
[2024-12-05 09:23:00,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-05 09:23:00,521 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-05 09:23:00,521 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-05 09:23:00,521 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-05 09:23:00,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:22:52" (3/4) ...
[2024-12-05 09:23:00,522 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-12-05 09:23:00,633 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 58.
[2024-12-05 09:23:00,704 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/witness.graphml
[2024-12-05 09:23:00,704 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/witness.yml
[2024-12-05 09:23:00,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-05 09:23:00,705 INFO L158 Benchmark]: Toolchain (without parser) took 9297.99ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 116.1MB in the beginning and 115.0MB in the end (delta: 1.1MB). Peak memory consumption was 195.0MB. Max. memory is 16.1GB.
[2024-12-05 09:23:00,705 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-05 09:23:00,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.99ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 96.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-12-05 09:23:00,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.80ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-05 09:23:00,706 INFO L158 Benchmark]: Boogie Preprocessor took 14.51ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-05 09:23:00,706 INFO L158 Benchmark]: RCFGBuilder took 354.40ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 73.3MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-12-05 09:23:00,707 INFO L158 Benchmark]: TraceAbstraction took 8372.06ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 72.7MB in the beginning and 143.9MB in the end (delta: -71.1MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB.
[2024-12-05 09:23:00,707 INFO L158 Benchmark]: Witness Printer took 183.36ms. Allocated memory is still 335.5MB. Free memory was 143.9MB in the beginning and 115.0MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-12-05 09:23:00,709 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.34ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 342.99ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 96.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 24.80ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 14.51ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 354.40ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 73.3MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 8372.06ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 72.7MB in the beginning and 143.9MB in the end (delta: -71.1MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB.
* Witness Printer took 183.36ms. Allocated memory is still 335.5MB. Free memory was 143.9MB in the beginning and 115.0MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Partial order reduction statistics
Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5893, independent: 4931, independent conditional: 4684, independent unconditional: 247, dependent: 962, dependent conditional: 955, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4938, independent: 4931, independent conditional: 4684, 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: 4938, independent: 4931, independent conditional: 4684, 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: 4938, independent: 4931, independent conditional: 4684, independent unconditional: 247, 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: 4938, independent: 4931, independent conditional: 0, independent unconditional: 4931, 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: 4938, independent: 4931, independent conditional: 0, independent unconditional: 4931, 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: 239, independent: 232, independent conditional: 0, independent unconditional: 232, 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: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4938, independent: 4699, independent conditional: 0, independent unconditional: 4699, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, 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: 4684, Maximal queried relation: 0, Independence queries for same thread: 955, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, 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: 5893, independent: 4931, independent conditional: 4684, independent unconditional: 247, dependent: 962, dependent conditional: 955, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4938, independent: 4931, independent conditional: 4684, 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: 4938, independent: 4931, independent conditional: 4684, 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: 4938, independent: 4931, independent conditional: 4684, independent unconditional: 247, 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: 4938, independent: 4931, independent conditional: 0, independent unconditional: 4931, 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: 4938, independent: 4931, independent conditional: 0, independent unconditional: 4931, 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: 239, independent: 232, independent conditional: 0, independent unconditional: 232, 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: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4938, independent: 4699, independent conditional: 0, independent unconditional: 4699, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, 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: 4684, Maximal queried relation: 0, Independence queries for same thread: 955
- CounterExampleResult [Line: 681]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L682] 0 int i, j;
[L685] 0 int p, q;
[L702] 0 int cur = 1, prev = 0, next = 0;
[L703] 0 int x;
[L713] 0 pthread_t id1, id2;
VAL [\old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0]
[L715] 0 i = 1
VAL [\old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0]
[L718] 0 j = 1
VAL [\old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0))
VAL [\old(arg)={0:0}, \old(argc)=196419, \old(argv)={196420:196421}, argc=196419, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0]
[L687] 1 p = 0
VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196419, \old(argv)={196420:196421}, arg={0:0}, argc=196419, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L695] 2 q = 0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L722] CALL, EXPR 0 fib()
[L705] 0 x = 0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=6, prev=8, q=6, x=6]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=6, x=6]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=7, prev=13, q=7, x=7]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=7, x=7]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=8, x=7]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=8, prev=21, q=8, x=8]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=8, x=8]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=9, x=8]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=9, prev=34, q=9, x=9]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=9, x=9]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=10, x=9]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=10, prev=55, q=10, x=10]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=10, x=10]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=11, x=10]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11]
[L687] COND TRUE 1 p < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11]
[L689] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=46368, next=144, p=11, prev=89, q=11, x=11]
[L687] 1 p++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=46368, next=144, p=12, prev=89, q=11, x=11]
[L695] COND TRUE 2 q < 12
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=46368, next=144, p=12, prev=89, q=11, x=11]
[L697] 2 j = j + i
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=121393, next=144, p=12, prev=89, q=11, x=11]
[L695] 2 q++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=75025, j=121393, next=144, p=12, prev=89, q=12, x=11]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=121393, next=233, p=12, prev=144, q=12, x=12]
[L687] COND FALSE 1 !(p < 12)
[L692] 1 return ((void *)0);
[L695] COND FALSE 2 !(q < 12)
[L700] 2 return ((void *)0);
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, i=75025, j=121393, next=610, p=12, prev=377, q=12, x=14]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=987, i=75025, j=121393, next=987, p=12, prev=610, q=12, x=15]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=75025, j=121393, next=1597, p=12, prev=987, q=12, x=16]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=75025, j=121393, next=2584, p=12, prev=1597, q=12, x=17]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=75025, j=121393, next=4181, p=12, prev=2584, q=12, x=18]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=75025, j=121393, next=6765, p=12, prev=4181, q=12, x=19]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=75025, j=121393, next=10946, p=12, prev=6765, q=12, x=20]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=75025, j=121393, next=17711, p=12, prev=10946, q=12, x=21]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=75025, j=121393, next=28657, p=12, prev=17711, q=12, x=22]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=75025, j=121393, next=46368, p=12, prev=28657, q=12, x=23]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=75025, j=121393, next=75025, p=12, prev=46368, q=12, x=24]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=75025, j=121393, next=121393, p=12, prev=75025, q=12, x=25]
[L705] COND TRUE 0 x < 26
[L706] 0 next = prev + cur
[L707] 0 prev = cur
[L708] 0 cur = next
[L705] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26]
[L705] COND FALSE 0 !(x < 26)
[L710] 0 return prev;
[L722] RET, EXPR 0 fib()
[L722] 0 int correct = fib();
[L724] 0 _Bool assert_cond = i < correct && j < correct;
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196419, \old(argv)={196420:196421}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=196419, assert_cond=0, correct=121393, cur=196418, i=75025, id1=-2, id2=-1, j=121393, next=196418, p=12, prev=121393, q=12, x=26]
[L726] CALL 0 __VERIFIER_assert(assert_cond)
[L681] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=196418, expression=0, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26]
[L681] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=196418, expression=0, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26]
- UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 5 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1155 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 3335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1546 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 2465/6132 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 17, ConditionCalculationTime [ms]: 0, ConditionCalculations: 20, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-12-05 09:23:00,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28e37535-cef7-4bb1-ad46-b3a709610057/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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