/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m
[2024-01-26 02:22:56,887 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-01-26 02:22:56,956 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf
[2024-01-26 02:22:56,960 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-01-26 02:22:56,961 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-01-26 02:22:56,961 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2024-01-26 02:22:56,999 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-01-26 02:22:56,999 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-01-26 02:22:56,999 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-01-26 02:22:57,000 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-01-26 02:22:57,000 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-01-26 02:22:57,000 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-01-26 02:22:57,001 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-01-26 02:22:57,001 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-01-26 02:22:57,001 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-01-26 02:22:57,001 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-01-26 02:22:57,001 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-01-26 02:22:57,002 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-01-26 02:22:57,002 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-01-26 02:22:57,002 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-01-26 02:22:57,002 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-01-26 02:22:57,006 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-01-26 02:22:57,006 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-01-26 02:22:57,006 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-01-26 02:22:57,009 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-01-26 02:22:57,009 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-01-26 02:22:57,009 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-01-26 02:22:57,010 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-01-26 02:22:57,010 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2024-01-26 02:22:57,010 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-01-26 02:22:57,011 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-01-26 02:22:57,011 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-01-26 02:22:57,011 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-01-26 02:22:57,011 INFO  L153        SettingsManager]:  * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL
[2024-01-26 02:22:57,011 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-01-26 02:22:57,011 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-01-26 02:22:57,011 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-01-26 02:22:57,011 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-01-26 02:22:57,012 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-01-26 02:22:57,012 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-01-26 02:22:57,012 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS
[2024-01-26 02:22:57,012 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION
[2024-01-26 02:22:57,224 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-01-26 02:22:57,254 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-01-26 02:22:57,256 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-01-26 02:22:57,257 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-01-26 02:22:57,257 INFO  L274        PluginConnector]: CDTParser initialized
[2024-01-26 02:22:57,258 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i
[2024-01-26 02:22:58,271 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-01-26 02:22:58,503 INFO  L384              CDTParser]: Found 1 translation units.
[2024-01-26 02:22:58,503 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i
[2024-01-26 02:22:58,519 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/53500046e/adbb38a5b8cd47a48cb2d4685b7dc651/FLAG0dbbb1f83
[2024-01-26 02:22:58,831 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/53500046e/adbb38a5b8cd47a48cb2d4685b7dc651
[2024-01-26 02:22:58,833 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-01-26 02:22:58,834 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-01-26 02:22:58,835 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-01-26 02:22:58,835 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-01-26 02:22:58,838 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-01-26 02:22:58,839 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:22:58" (1/1) ...
[2024-01-26 02:22:58,839 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373cdd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:58, skipping insertion in model container
[2024-01-26 02:22:58,839 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:22:58" (1/1) ...
[2024-01-26 02:22:58,884 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-01-26 02:22:59,191 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771]
[2024-01-26 02:22:59,195 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-01-26 02:22:59,214 INFO  L202         MainTranslator]: Completed pre-run
[2024-01-26 02:22:59,260 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771]
[2024-01-26 02:22:59,261 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-01-26 02:22:59,305 INFO  L206         MainTranslator]: Completed translation
[2024-01-26 02:22:59,306 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59 WrapperNode
[2024-01-26 02:22:59,306 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-01-26 02:22:59,307 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-01-26 02:22:59,307 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-01-26 02:22:59,307 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-01-26 02:22:59,311 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,323 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,345 INFO  L138                Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80
[2024-01-26 02:22:59,345 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-01-26 02:22:59,346 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-01-26 02:22:59,346 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-01-26 02:22:59,346 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-01-26 02:22:59,356 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,356 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,358 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,359 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,362 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,368 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,370 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,370 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,372 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-01-26 02:22:59,373 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-01-26 02:22:59,373 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-01-26 02:22:59,373 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-01-26 02:22:59,374 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (1/1) ...
[2024-01-26 02:22:59,377 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-01-26 02:22:59,391 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:22:59,408 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-01-26 02:22:59,427 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-01-26 02:22:59,434 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-01-26 02:22:59,435 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-01-26 02:22:59,435 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-01-26 02:22:59,435 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-01-26 02:22:59,435 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-01-26 02:22:59,435 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2024-01-26 02:22:59,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2024-01-26 02:22:59,435 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2024-01-26 02:22:59,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2024-01-26 02:22:59,435 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-01-26 02:22:59,437 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-01-26 02:22:59,437 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-01-26 02:22:59,437 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-01-26 02:22:59,437 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-01-26 02:22:59,437 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-01-26 02:22:59,439 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-01-26 02:22:59,604 INFO  L241             CfgBuilder]: Building ICFG
[2024-01-26 02:22:59,606 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-01-26 02:22:59,802 INFO  L282             CfgBuilder]: Performing block encoding
[2024-01-26 02:22:59,821 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-01-26 02:22:59,821 INFO  L309             CfgBuilder]: Removed 4 assume(true) statements.
[2024-01-26 02:22:59,821 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:22:59 BoogieIcfgContainer
[2024-01-26 02:22:59,821 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-01-26 02:22:59,822 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-01-26 02:22:59,823 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-01-26 02:22:59,825 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-01-26 02:22:59,825 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 02:22:58" (1/3) ...
[2024-01-26 02:22:59,825 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afc3029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:22:59, skipping insertion in model container
[2024-01-26 02:22:59,825 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:22:59" (2/3) ...
[2024-01-26 02:22:59,826 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afc3029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:22:59, skipping insertion in model container
[2024-01-26 02:22:59,826 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:22:59" (3/3) ...
[2024-01-26 02:22:59,827 INFO  L112   eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i
[2024-01-26 02:22:59,833 WARN  L146   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-01-26 02:22:59,839 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-01-26 02:22:59,840 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-01-26 02:22:59,840 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-01-26 02:22:59,892 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-01-26 02:22:59,930 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:22:59,931 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-01-26 02:22:59,931 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:22:59,933 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-01-26 02:22:59,935 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-01-26 02:22:59,959 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-01-26 02:22:59,966 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ========
[2024-01-26 02:22:59,970 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d8ecb08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:22:59,970 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2024-01-26 02:23:00,217 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:23:00,220 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:23:00,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -172726807, now seen corresponding path program 1 times
[2024-01-26 02:23:00,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:23:00,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703123651]
[2024-01-26 02:23:00,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:23:00,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:23:00,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:23:00,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-01-26 02:23:00,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:23:00,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703123651]
[2024-01-26 02:23:00,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703123651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 02:23:00,656 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-26 02:23:00,656 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-01-26 02:23:00,656 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072726342]
[2024-01-26 02:23:00,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:23:00,664 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-01-26 02:23:00,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:23:00,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-01-26 02:23:00,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-01-26 02:23:00,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:23:00,696 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:23:00,697 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-01-26 02:23:00,697 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2024-01-26 02:23:00,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:00,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-01-26 02:23:00,809 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:23:00,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:23:00,809 INFO  L85        PathProgramCache]: Analyzing trace with hash 284676300, now seen corresponding path program 2 times
[2024-01-26 02:23:00,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:23:00,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016840593]
[2024-01-26 02:23:00,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:23:00,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:23:00,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:23:00,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 110 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2024-01-26 02:23:00,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:23:00,979 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016840593]
[2024-01-26 02:23:00,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016840593] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 02:23:00,979 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-26 02:23:00,979 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-01-26 02:23:00,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099832307]
[2024-01-26 02:23:00,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:23:00,980 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-01-26 02:23:00,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:23:00,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-01-26 02:23:00,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-01-26 02:23:00,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:23:00,981 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:23:00,982 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-01-26 02:23:00,982 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:00,982 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2024-01-26 02:23:01,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,097 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-01-26 02:23:01,097 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:23:01,098 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:23:01,098 INFO  L85        PathProgramCache]: Analyzing trace with hash 2023985945, now seen corresponding path program 3 times
[2024-01-26 02:23:01,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:23:01,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687621751]
[2024-01-26 02:23:01,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:23:01,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:23:01,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:23:01,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 212 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked.
[2024-01-26 02:23:01,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:23:01,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687621751]
[2024-01-26 02:23:01,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687621751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 02:23:01,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-26 02:23:01,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-01-26 02:23:01,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078246926]
[2024-01-26 02:23:01,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:23:01,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-01-26 02:23:01,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:23:01,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-01-26 02:23:01,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-01-26 02:23:01,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:23:01,373 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:23:01,373 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-26 02:23:01,373 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,373 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,373 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2024-01-26 02:23:01,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-01-26 02:23:01,445 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:23:01,446 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:23:01,446 INFO  L85        PathProgramCache]: Analyzing trace with hash -735726399, now seen corresponding path program 4 times
[2024-01-26 02:23:01,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:23:01,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353012971]
[2024-01-26 02:23:01,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:23:01,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:23:01,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:23:01,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-01-26 02:23:01,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:23:01,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353012971]
[2024-01-26 02:23:01,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353012971] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 02:23:01,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615928338]
[2024-01-26 02:23:01,639 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-01-26 02:23:01,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:23:01,640 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:23:01,690 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-01-26 02:23:01,696 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-01-26 02:23:01,809 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-01-26 02:23:01,809 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-01-26 02:23:01,811 INFO  L262         TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-01-26 02:23:01,818 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 02:23:01,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-01-26 02:23:01,912 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-01-26 02:23:01,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-01-26 02:23:01,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615928338] provided 0 perfect and 2 imperfect interpolant sequences
[2024-01-26 02:23:01,983 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-01-26 02:23:01,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6
[2024-01-26 02:23:01,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988963611]
[2024-01-26 02:23:01,983 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-01-26 02:23:01,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-26 02:23:01,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:23:01,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-26 02:23:01,984 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-01-26 02:23:01,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:23:01,985 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:23:01,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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-01-26 02:23:01,985 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,985 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,985 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:01,985 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2024-01-26 02:23:02,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:02,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:02,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-01-26 02:23:02,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-01-26 02:23:02,108 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-01-26 02:23:02,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:23:02,301 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:23:02,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:23:02,301 INFO  L85        PathProgramCache]: Analyzing trace with hash -2061799512, now seen corresponding path program 5 times
[2024-01-26 02:23:02,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:23:02,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208392974]
[2024-01-26 02:23:02,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:23:02,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:23:02,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-01-26 02:23:02,348 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-01-26 02:23:02,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-01-26 02:23:02,419 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-01-26 02:23:02,420 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-01-26 02:23:02,420 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-01-26 02:23:02,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-01-26 02:23:02,428 INFO  L445         BasicCegarLoop]: Path program histogram: [5]
[2024-01-26 02:23:02,429 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/3)
[2024-01-26 02:23:02,431 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-01-26 02:23:02,431 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2024-01-26 02:23:02,515 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 02:23:02 BasicIcfg
[2024-01-26 02:23:02,515 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-01-26 02:23:02,516 INFO  L158              Benchmark]: Toolchain (without parser) took 3681.88ms. Allocated memory was 170.9MB in the beginning and 230.7MB in the end (delta: 59.8MB). Free memory was 134.6MB in the beginning and 93.4MB in the end (delta: 41.1MB). Peak memory consumption was 101.9MB. Max. memory is 8.0GB.
[2024-01-26 02:23:02,516 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-01-26 02:23:02,516 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 471.27ms. Allocated memory is still 170.9MB. Free memory was 134.6MB in the beginning and 107.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB.
[2024-01-26 02:23:02,516 INFO  L158              Benchmark]: Boogie Procedure Inliner took 38.71ms. Allocated memory is still 170.9MB. Free memory was 107.3MB in the beginning and 104.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2024-01-26 02:23:02,517 INFO  L158              Benchmark]: Boogie Preprocessor took 26.32ms. Allocated memory is still 170.9MB. Free memory was 104.7MB in the beginning and 103.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2024-01-26 02:23:02,517 INFO  L158              Benchmark]: RCFGBuilder took 448.34ms. Allocated memory is still 170.9MB. Free memory was 103.1MB in the beginning and 84.2MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB.
[2024-01-26 02:23:02,517 INFO  L158              Benchmark]: TraceAbstraction took 2692.95ms. Allocated memory was 170.9MB in the beginning and 230.7MB in the end (delta: 59.8MB). Free memory was 83.2MB in the beginning and 93.4MB in the end (delta: -10.2MB). Peak memory consumption was 50.5MB. Max. memory is 8.0GB.
[2024-01-26 02:23:02,518 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.10ms. Allocated memory is still 170.9MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 471.27ms. Allocated memory is still 170.9MB. Free memory was 134.6MB in the beginning and 107.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 38.71ms. Allocated memory is still 170.9MB. Free memory was 107.3MB in the beginning and 104.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 26.32ms. Allocated memory is still 170.9MB. Free memory was 104.7MB in the beginning and 103.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 448.34ms. Allocated memory is still 170.9MB. Free memory was 103.1MB in the beginning and 84.2MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB.
 * TraceAbstraction took 2692.95ms. Allocated memory was 170.9MB in the beginning and 230.7MB in the end (delta: 59.8MB). Free memory was 83.2MB in the beginning and 93.4MB in the end (delta: -10.2MB). Peak memory consumption was 50.5MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 553, independent: 469, independent conditional: 469, independent unconditional: 0, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 492, independent: 469, independent conditional: 469, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 492, independent: 469, independent conditional: 469, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 531, independent: 469, independent conditional: 0, independent unconditional: 469, dependent: 62, dependent conditional: 39, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 531, independent: 469, independent conditional: 0, independent unconditional: 469, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 531, independent: 469, independent conditional: 0, independent unconditional: 469, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 492, independent: 469, independent conditional: 0, independent unconditional: 469, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 492, independent: 456, independent conditional: 0, independent unconditional: 456, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 531, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 492, unknown conditional: 0, unknown unconditional: 492] , Statistics on independence cache: Total cache size (in pairs): 492, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 4, Independence queries for same thread: 61
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 89, Times there's more than one choice: 37, Avg number of choices: 1.8764044943820224
  - StatisticsResult: Reduction benchmarks
    0.0s Time before loop, 0.1s Time in loop, 0.1s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, write~init~$Pointer$_#value.offset, ~tzname~0.offset, old(~tzname~0.offset), write~int_#ptr.base, thread1_~arg.base, thread2_~arg.base, ~stdout~0.base, old(~stdout~0.base), ~timezone~0, old(~timezone~0), #memory_$Pointer$.base, old(#memory_$Pointer$.base), thread1_#in~arg.base, thread2_#in~arg.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~mem21#1, thread1_~i~0, thread2_~j~0, ~__daylight~0, old(~__daylight~0), ULTIMATE.start_main_#res#1, thread2Thread1of1ForFork1_#res.offset, thread1_#t~nondet4, thread1_#t~nondet5, thread1_#t~nondet6, thread1_#t~nondet8, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_#in~arg.base, read~int_#ptr.base, thread1Thread1of1ForFork0_~i~0, #PthreadsMutexLock_#inputPtr.offset, ULTIMATE.start_#t~ret22#1, thread1_#res.offset, thread2_#res.offset, ~stderr~0.base, old(~stderr~0.base), thread2Thread1of1ForFork1_#in~arg.offset, ~#full~0.offset, old(~#full~0.offset), ~#empty~0.offset, old(~#empty~0.offset), thread1Thread1of1ForFork0_#t~nondet4, thread1Thread1of1ForFork0_#t~nondet5, thread1Thread1of1ForFork0_#t~nondet6, thread1Thread1of1ForFork0_#t~nondet8, ~stdout~0.offset, old(~stdout~0.offset), ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, ~#empty~0.base, old(~#empty~0.base), thread1Thread1of1ForFork0_#res.offset, #memory_$Pointer$.offset, old(#memory_$Pointer$.offset), ~total~0, old(~total~0), thread2Thread1of1ForFork1_#t~post13, thread2Thread1of1ForFork1_#t~post15, ~num~0, old(~num~0), thread1_#in~arg.offset, thread2_#in~arg.offset, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, ~daylight~0, old(~daylight~0), ~tzname~0.base, old(~tzname~0.base), ULTIMATE.start_main_~#t1~0#1.offset, ~#full~0.base, old(~#full~0.base), thread2_#t~post13, thread2_#t~post15, thread1Thread1of1ForFork0_#in~arg.offset, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~pre18#1, #PthreadsMutexUnlock_#inputPtr.base, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, ~__tzname~0.offset, old(~__tzname~0.offset), write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, ~flag~0, old(~flag~0), thread2Thread1of1ForFork1_~arg.offset, #pthreadsForks, old(#pthreadsForks), #valid, old(#valid), #pthreadsMutex, old(#pthreadsMutex), thread1_~arg.offset, thread2_~arg.offset, read~int_#value, #Ultimate.allocInit_~size, thread2Thread1of1ForFork1_#res.base, #PthreadsMutexLock_#inputPtr.base, write~init~int_#ptr.base, thread2Thread1of1ForFork1_thidvar0, old(thread2Thread1of1ForFork1_thidvar0), thread2Thread1of1ForFork1_thidvar1, old(thread2Thread1of1ForFork1_thidvar1), thread2Thread1of1ForFork1_thidvar2, old(thread2Thread1of1ForFork1_thidvar2), #PthreadsMutexUnlock_#res, ~stderr~0.offset, old(~stderr~0.offset), thread1Thread1of1ForFork0_~arg.offset, write~init~$Pointer$_#value.base, thread1_#res.base, thread2_#res.base, ~#m~0.offset, old(~#m~0.offset), write~init~$Pointer$_#sizeOfWrittenType, ~#m~0.base, old(~#m~0.base), #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t1~0#1.base, #length, old(#length), thread2Thread1of1ForFork1_#t~nondet10, thread2Thread1of1ForFork1_#t~nondet11, thread2Thread1of1ForFork1_#t~nondet12, thread2Thread1of1ForFork1_#t~nondet14, ULTIMATE.start_main_~#t2~0#1.base, ~stdin~0.base, old(~stdin~0.base), write~int_#sizeOfWrittenType, #StackHeapBarrier, old(#StackHeapBarrier), thread1Thread1of1ForFork0_#res.base, ~__timezone~0, old(~__timezone~0), #PthreadsMutexLock_#res, write~init~$Pointer$_#ptr.offset, thread1_#t~post7, thread1_#t~post9, thread2_#t~nondet10, thread2_#t~nondet11, thread2_#t~nondet12, thread2_#t~nondet14, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), write~int_#ptr.offset, ~__tzname~0.base, old(~__tzname~0.base), ~stdin~0.offset, old(~stdin~0.offset), #memory_int, old(#memory_int), thread1Thread1of1ForFork0_#t~post7, thread1Thread1of1ForFork0_#t~post9, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork1_~arg.base, thread2Thread1of1ForFork1_#in~arg.base, thread2Thread1of1ForFork1_~j~0, write~init~$Pointer$_#ptr.base, read~int_#ptr.offset, #PthreadsMutexUnlock_#inputPtr.offset], Protected Variables before encountering a loop: []
  - CounterExampleResult [Line: 919]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L870]               0  int num;
        VAL             [num=0]
[L871]               0  unsigned long total;
        VAL             [num=0, total=0]
[L872]               0  int flag;
        VAL             [flag=0, num=0, total=0]
[L873]               0  pthread_mutex_t m;
        VAL             [flag=0, m={3:0}, num=0, total=0]
[L874]               0  pthread_cond_t empty, full;
        VAL             [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0]
[L907]               0  pthread_t t1, t2;
        VAL             [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0]
[L908]               0  num = 0
        VAL             [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0]
[L909]               0  total = 0
        VAL             [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0]
[L913]  FCALL, FORK  0  pthread_create(&t1, 0, thread1, 0)
        VAL             [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0]
[L914]  FCALL, FORK  0  pthread_create(&t2, 0, thread2, 0)
        VAL             [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0]
[L915]               0  \read(t1)
        VAL             [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0]
[L876]               1  int i;
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0]
[L877]               1  i = 0
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0]
[L878]  COND TRUE    1  i < 3
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0]
[L880]  COND FALSE   1  !(num > 0)
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0]
[L882]               1  num++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, total=0]
[L885]               1  i++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0]
[L878]  COND TRUE    1  i < 3
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0]
[L880]  COND TRUE    1  num > 0
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0]
[L880]  COND TRUE    1  num > 0
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0]
[L890]               2  int j;
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0]
[L891]               2  j = 0
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0]
[L892]  COND TRUE    2  j < 3
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0]
[L894]  COND FALSE   2  !(num == 0)
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0]
[L896]               2  total = total + j
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0]
[L897]               2  num--
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0]
[L880]  COND FALSE   1  !(num > 0)
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0]
[L882]               1  num++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0]
[L885]               1  i++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=0, m={3:0}, num=1, total=0]
[L878]  COND TRUE    1  i < 3
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=0, m={3:0}, num=1, total=0]
[L900]               2  j++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0]
[L892]  COND TRUE    2  j < 3
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0]
[L894]  COND FALSE   2  !(num == 0)
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0]
[L896]               2  total = total + j
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1]
[L897]               2  num--
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1]
[L900]               2  j++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1]
[L892]  COND TRUE    2  j < 3
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1]
[L894]  COND TRUE    2  num == 0
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1]
[L880]  COND FALSE   1  !(num > 0)
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1]
[L882]               1  num++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1]
[L885]               1  i++
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1]
[L878]  COND FALSE   1  !(i < 3)
        VAL             [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1]
[L887]               1  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1]
[L915]  FCALL, JOIN  1  pthread_join(t1, 0)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1]
[L916]               0  \read(t2)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1]
[L894]  COND FALSE   2  !(num == 0)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1]
[L896]               2  total = total + j
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3]
[L897]               2  num--
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3]
[L900]               2  j++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3]
[L892]  COND FALSE   2  !(j < 3)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3]
[L902]               2  total = total + j
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6]
[L903]               2  flag = 1
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6]
[L904]               2  return ((void *)0);
        VAL             [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6]
[L916]  FCALL, JOIN  2  pthread_join(t2, 0)
        VAL             [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6]
[L917]  COND TRUE    0  \read(flag)
        VAL             [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6]
[L918]  COND FALSE   0  !(total != ((3 * (3 + 1)) / 2))
        VAL             [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6]
[L919]               0  reach_error()
        VAL             [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6]

  - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances
    CFG has 5 procedures, 167 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 961 NumberOfCodeBlocks, 939 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 942 ConstructedInterpolants, 0 QuantifiedInterpolants, 1248 SizeOfPredicates, 4 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 534/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-01-26 02:23:02,546 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0
[2024-01-26 02:23:02,741 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...