/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-fffa3fa-m [2023-09-05 00:12:21,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-05 00:12:21,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-05 00:12:21,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-05 00:12:21,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-05 00:12:21,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-05 00:12:21,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-05 00:12:21,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-05 00:12:21,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-05 00:12:21,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-05 00:12:21,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-05 00:12:21,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-05 00:12:21,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-05 00:12:21,886 INFO L153 SettingsManager]: * Use SBE=true [2023-09-05 00:12:21,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-05 00:12:21,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-05 00:12:21,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-05 00:12:21,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-05 00:12:21,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-05 00:12:21,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-05 00:12:21,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-05 00:12:21,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-05 00:12:21,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-05 00:12:21,888 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-05 00:12:21,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-05 00:12:21,889 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-05 00:12:21,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-05 00:12:21,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-05 00:12:21,890 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-05 00:12:21,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-05 00:12:21,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-05 00:12:21,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-05 00:12:21,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-05 00:12:21,891 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-05 00:12:21,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-05 00:12:21,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-05 00:12:21,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-05 00:12:21,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-05 00:12:21,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-05 00:12:21,892 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-05 00:12:21,892 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-05 00:12:21,893 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/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-09-05 00:12:22,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-05 00:12:22,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-05 00:12:22,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-05 00:12:22,130 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-05 00:12:22,131 INFO L274 PluginConnector]: CDTParser initialized [2023-09-05 00:12:22,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2023-09-05 00:12:23,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-05 00:12:23,459 INFO L384 CDTParser]: Found 1 translation units. [2023-09-05 00:12:23,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2023-09-05 00:12:23,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3866b7e/4ff2b2914eff4b5f82859cb6f83a5159/FLAG40055dbc9 [2023-09-05 00:12:23,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3866b7e/4ff2b2914eff4b5f82859cb6f83a5159 [2023-09-05 00:12:23,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-05 00:12:23,485 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-05 00:12:23,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-05 00:12:23,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-05 00:12:23,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-05 00:12:23,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b29e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23, skipping insertion in model container [2023-09-05 00:12:23,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,532 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-09-05 00:12:23,754 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] [2023-09-05 00:12:23,760 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] [2023-09-05 00:12:23,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-05 00:12:23,774 INFO L201 MainTranslator]: Completed pre-run [2023-09-05 00:12:23,788 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [208] [2023-09-05 00:12:23,789 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [209] [2023-09-05 00:12:23,803 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] [2023-09-05 00:12:23,806 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] [2023-09-05 00:12:23,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-05 00:12:23,841 INFO L206 MainTranslator]: Completed translation [2023-09-05 00:12:23,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23 WrapperNode [2023-09-05 00:12:23,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-05 00:12:23,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-05 00:12:23,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-05 00:12:23,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-05 00:12:23,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,879 INFO L138 Inliner]: procedures = 168, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-09-05 00:12:23,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-05 00:12:23,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-05 00:12:23,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-05 00:12:23,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-05 00:12:23,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-05 00:12:23,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-05 00:12:23,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-05 00:12:23,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-05 00:12:23,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (1/1) ... [2023-09-05 00:12:23,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-05 00:12:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:23,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-05 00:12:23,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-05 00:12:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-05 00:12:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-05 00:12:23,973 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-05 00:12:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-05 00:12:23,974 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-05 00:12:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-05 00:12:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-05 00:12:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-05 00:12:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-05 00:12:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-05 00:12:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-09-05 00:12:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-05 00:12:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-05 00:12:23,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-05 00:12:23,977 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-05 00:12:24,125 INFO L236 CfgBuilder]: Building ICFG [2023-09-05 00:12:24,127 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-05 00:12:24,308 INFO L277 CfgBuilder]: Performing block encoding [2023-09-05 00:12:24,315 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-05 00:12:24,315 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-05 00:12:24,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:12:24 BoogieIcfgContainer [2023-09-05 00:12:24,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-05 00:12:24,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-05 00:12:24,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-05 00:12:24,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-05 00:12:24,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:12:23" (1/3) ... [2023-09-05 00:12:24,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cfe74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:12:24, skipping insertion in model container [2023-09-05 00:12:24,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:23" (2/3) ... [2023-09-05 00:12:24,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cfe74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:12:24, skipping insertion in model container [2023-09-05 00:12:24,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:12:24" (3/3) ... [2023-09-05 00:12:24,325 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2023-09-05 00:12:24,331 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-05 00:12:24,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-05 00:12:24,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-05 00:12:24,339 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-05 00:12:24,442 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-05 00:12:24,476 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-05 00:12:24,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-05 00:12:24,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:24,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-05 00:12:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-05 00:12:24,534 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-05 00:12:24,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-05 00:12:24,546 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;@5bacd5cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-05 00:12:24,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 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 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 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 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 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 [2023-09-05 00:12:24,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:12:24,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1223156465, now seen corresponding path program 1 times [2023-09-05 00:12:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263448622] [2023-09-05 00:12:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:24,830 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:12:24,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1883724553] [2023-09-05 00:12:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:24,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:24,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:24,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-05 00:12:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:25,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-05 00:12:25,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:25,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-05 00:12:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-09-05 00:12:25,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-05 00:12:25,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263448622] [2023-09-05 00:12:25,257 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:12:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883724553] [2023-09-05 00:12:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883724553] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-05 00:12:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-05 00:12:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-05 00:12:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17124844] [2023-09-05 00:12:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-05 00:12:25,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-05 00:12:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-05 00:12:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-05 00:12:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:25,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:25,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:25,303 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 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 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 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 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 [2023-09-05 00:12:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:25,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-05 00:12:25,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-09-05 00:12:25,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:12:25,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash 940809431, now seen corresponding path program 1 times [2023-09-05 00:12:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:25,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128698056] [2023-09-05 00:12:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:25,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:25,678 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:12:25,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251453079] [2023-09-05 00:12:25,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:25,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:25,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:25,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:25,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-05 00:12:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:25,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-05 00:12:25,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-05 00:12:25,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-05 00:12:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-05 00:12:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128698056] [2023-09-05 00:12:25,892 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:12:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251453079] [2023-09-05 00:12:25,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251453079] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-05 00:12:25,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-05 00:12:25,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-09-05 00:12:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171792248] [2023-09-05 00:12:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-05 00:12:25,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-05 00:12:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-05 00:12:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-05 00:12:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:25,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:25,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:25,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:25,901 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 [2023-09-05 00:12:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:26,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-05 00:12:26,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:26,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:12:26,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash 903656534, now seen corresponding path program 1 times [2023-09-05 00:12:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:26,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781183970] [2023-09-05 00:12:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:26,272 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:12:26,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934303688] [2023-09-05 00:12:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:26,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:26,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:26,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-05 00:12:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:26,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-05 00:12:26,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-09-05 00:12:26,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-05 00:12:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-09-05 00:12:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781183970] [2023-09-05 00:12:26,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:12:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934303688] [2023-09-05 00:12:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934303688] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-05 00:12:26,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-05 00:12:26,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-09-05 00:12:26,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947880544] [2023-09-05 00:12:26,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-05 00:12:26,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-05 00:12:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-05 00:12:26,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-09-05 00:12:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:26,722 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:26,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.583333333333332) internal successors, (223), 12 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:26,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:26,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:26,722 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 [2023-09-05 00:12:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:12:26,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-05 00:12:27,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:27,062 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:12:27,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1038663930, now seen corresponding path program 1 times [2023-09-05 00:12:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517645394] [2023-09-05 00:12:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:27,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:27,096 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:12:27,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557955318] [2023-09-05 00:12:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:27,097 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:27,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-05 00:12:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:27,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-05 00:12:27,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-05 00:12:27,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-05 00:12:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-05 00:12:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517645394] [2023-09-05 00:12:27,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:12:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557955318] [2023-09-05 00:12:27,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557955318] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-05 00:12:27,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-05 00:12:27,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2023-09-05 00:12:27,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593546928] [2023-09-05 00:12:27,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-05 00:12:27,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-05 00:12:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:27,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-05 00:12:27,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-09-05 00:12:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:27,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:27,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.266666666666667) internal successors, (169), 15 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:27,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:27,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:27,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:12:27,527 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 [2023-09-05 00:12:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:12:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:12:27,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-05 00:12:27,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:27,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:12:27,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2694106, now seen corresponding path program 2 times [2023-09-05 00:12:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827505291] [2023-09-05 00:12:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:27,924 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:12:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823711212] [2023-09-05 00:12:27,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-05 00:12:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:27,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:27,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-05 00:12:28,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-05 00:12:28,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-05 00:12:28,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-05 00:12:28,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-09-05 00:12:28,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-05 00:12:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2023-09-05 00:12:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:28,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827505291] [2023-09-05 00:12:28,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:12:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823711212] [2023-09-05 00:12:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823711212] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-05 00:12:28,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-05 00:12:28,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-09-05 00:12:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901076886] [2023-09-05 00:12:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-05 00:12:28,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-05 00:12:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:28,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-05 00:12:28,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-05 00:12:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:28,224 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:28,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:28,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:12:28,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:12:28,224 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 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-05 00:12:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:12:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:12:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-05 00:12:28,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:28,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:12:28,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 398843226, now seen corresponding path program 1 times [2023-09-05 00:12:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038709415] [2023-09-05 00:12:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:28,482 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:12:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089400864] [2023-09-05 00:12:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:28,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:28,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:28,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:28,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-05 00:12:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:28,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-05 00:12:28,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-05 00:12:28,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-05 00:12:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038709415] [2023-09-05 00:12:28,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:12:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089400864] [2023-09-05 00:12:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089400864] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-05 00:12:28,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-05 00:12:28,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-09-05 00:12:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106900279] [2023-09-05 00:12:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-05 00:12:28,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-09-05 00:12:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:28,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-09-05 00:12:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-09-05 00:12:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:28,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:28,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:28,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:12:28,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:12:28,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,801 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-05 00:12:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:12:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:12:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-05 00:12:29,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-05 00:12:29,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:29,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:12:29,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash -270750332, now seen corresponding path program 2 times [2023-09-05 00:12:29,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:29,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223756574] [2023-09-05 00:12:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:29,228 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:12:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949250972] [2023-09-05 00:12:29,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-05 00:12:29,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:29,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:29,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:29,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-05 00:12:29,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-05 00:12:29,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-05 00:12:29,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 37 conjunts are in the unsatisfiable core [2023-09-05 00:12:29,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:29,467 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-09-05 00:12:29,590 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-05 00:12:29,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-05 00:12:29,625 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-05 00:12:29,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-05 00:12:29,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-09-05 00:12:29,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-09-05 00:12:29,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2023-09-05 00:12:30,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2023-09-05 00:12:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-09-05 00:12:30,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-05 00:13:04,681 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_z_14 Int) (|~#buffer~0.offset| Int) (v_z_11 Int)) (or (< 2147483648 v_z_11) (< 2147483647 v_z_14) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_744) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_14) 0) (+ |~#buffer~0.offset| (- 1) v_z_11))) (< v_z_11 1) (< v_z_14 0))) is different from false [2023-09-05 00:13:04,772 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_z_14 Int) (v_ArrVal_743 (Array Int Int)) (|~#buffer~0.offset| Int) (v_z_11 Int)) (or (< 2147483648 v_z_11) (< 2147483647 v_z_14) (= (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_744) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| v_z_14) 0) (+ |~#buffer~0.offset| (- 1) v_z_11)) 0) (< v_z_11 1) (< v_z_14 0))) is different from false [2023-09-05 00:13:05,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2023-09-05 00:13:05,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2023-09-05 00:13:05,582 INFO L322 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-09-05 00:13:05,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2023-09-05 00:13:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-09-05 00:13:05,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:13:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223756574] [2023-09-05 00:13:05,589 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:13:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949250972] [2023-09-05 00:13:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949250972] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-05 00:13:05,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-05 00:13:05,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2023-09-05 00:13:05,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481964839] [2023-09-05 00:13:05,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-05 00:13:05,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-05 00:13:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:13:05,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-05 00:13:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=722, Unknown=16, NotChecked=114, Total=992 [2023-09-05 00:13:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:13:05,591 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:13:05,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.90625) internal successors, (221), 32 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:13:05,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:13:05,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:13:05,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:13:05,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:13:05,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:13:05,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-09-05 00:13:05,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:13:30,327 WARN L234 SmtUtils]: Spent 20.28s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-05 00:13:32,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:34,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-05 00:13:36,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:38,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:40,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:42,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:44,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:48,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:50,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:52,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-05 00:13:54,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:56,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:13:58,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-05 00:14:01,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-05 00:14:03,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] 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 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 Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-05 00:14:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:14:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:14:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-05 00:14:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-05 00:14:04,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-05 00:14:04,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-09-05 00:14:04,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:14:04,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:14:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1724760861, now seen corresponding path program 1 times [2023-09-05 00:14:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:14:04,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119558492] [2023-09-05 00:14:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:14:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:14:04,754 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:14:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116926235] [2023-09-05 00:14:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:14:04,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:14:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:14:04,756 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:14:04,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-05 00:14:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:14:05,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-05 00:14:05,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:14:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-09-05 00:14:05,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-05 00:14:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-09-05 00:14:06,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:14:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119558492] [2023-09-05 00:14:06,664 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-05 00:14:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116926235] [2023-09-05 00:14:06,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116926235] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-05 00:14:06,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-05 00:14:06,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2023-09-05 00:14:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939963060] [2023-09-05 00:14:06,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-05 00:14:06,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-05 00:14:06,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:14:06,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-05 00:14:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-09-05 00:14:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:14:06,666 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:14:06,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.266666666666667) internal successors, (169), 15 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:14:06,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:06,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:06,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:14:06,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:14:06,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:06,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-09-05 00:14:06,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-05 00:14:06,667 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 [2023-09-05 00:14:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-05 00:14:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-05 00:14:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:14:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-05 00:14:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-09-05 00:14:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-05 00:14:08,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-05 00:14:08,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:14:08,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-05 00:14:08,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:14:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 992910362, now seen corresponding path program 3 times [2023-09-05 00:14:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:14:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328241809] [2023-09-05 00:14:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:14:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:14:08,223 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-09-05 00:14:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268247848] [2023-09-05 00:14:08,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-05 00:14:08,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:14:08,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:14:08,225 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:14:08,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-05 00:14:09,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-09-05 00:14:09,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-09-05 00:14:09,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-05 00:14:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-05 00:14:09,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-05 00:14:09,353 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-05 00:14:09,354 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-05 00:14:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-09-05 00:14:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-05 00:14:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-09-05 00:14:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-09-05 00:14:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-05 00:14:09,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-09-05 00:14:09,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-09-05 00:14:09,560 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-09-05 00:14:09,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-05 00:14:09,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-05 00:14:09,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:14:09 BasicIcfg [2023-09-05 00:14:09,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-05 00:14:09,692 INFO L158 Benchmark]: Toolchain (without parser) took 106206.80ms. Allocated memory was 161.5MB in the beginning and 267.4MB in the end (delta: 105.9MB). Free memory was 110.7MB in the beginning and 215.6MB in the end (delta: -104.9MB). Peak memory consumption was 136.8MB. Max. memory is 7.0GB. [2023-09-05 00:14:09,692 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 161.5MB. Free memory was 117.0MB in the beginning and 116.9MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 7.0GB. [2023-09-05 00:14:09,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.02ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 90.1MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 7.0GB. [2023-09-05 00:14:09,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 87.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-05 00:14:09,693 INFO L158 Benchmark]: Boogie Preprocessor took 24.42ms. Allocated memory is still 161.5MB. Free memory was 87.7MB in the beginning and 85.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-05 00:14:09,693 INFO L158 Benchmark]: RCFGBuilder took 412.26ms. Allocated memory was 161.5MB in the beginning and 222.3MB in the end (delta: 60.8MB). Free memory was 85.9MB in the beginning and 183.8MB in the end (delta: -97.9MB). Peak memory consumption was 12.8MB. Max. memory is 7.0GB. [2023-09-05 00:14:09,694 INFO L158 Benchmark]: TraceAbstraction took 105372.65ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 183.3MB in the beginning and 215.6MB in the end (delta: -32.3MB). Peak memory consumption was 147.0MB. Max. memory is 7.0GB. [2023-09-05 00:14:09,695 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 161.5MB. Free memory was 117.0MB in the beginning and 116.9MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 355.02ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 90.1MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 87.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 24.42ms. Allocated memory is still 161.5MB. Free memory was 87.7MB in the beginning and 85.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 412.26ms. Allocated memory was 161.5MB in the beginning and 222.3MB in the end (delta: 60.8MB). Free memory was 85.9MB in the beginning and 183.8MB in the end (delta: -97.9MB). Peak memory consumption was 12.8MB. Max. memory is 7.0GB. * TraceAbstraction took 105372.65ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 183.3MB in the beginning and 215.6MB in the end (delta: -32.3MB). Peak memory consumption was 147.0MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 208]: Unsoundness Warning unspecified type, defaulting to int C: short [208] - GenericResultAtLocation [Line: 209]: Unsoundness Warning unspecified type, defaulting to int C: short [209] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1054, independent: 911, independent conditional: 911, independent unconditional: 0, dependent: 143, dependent conditional: 143, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 915, independent: 911, independent conditional: 911, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 915, independent: 911, independent conditional: 911, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 925, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 925, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 925, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 915, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 915, independent: 909, independent conditional: 0, independent unconditional: 909, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 925, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 915, unknown conditional: 0, unknown unconditional: 915] , Statistics on independence cache: Total cache size (in pairs): 915, Positive cache size: 911, Positive conditional cache size: 0, Positive unconditional cache size: 911, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 8, Independence queries for same thread: 139 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 16 - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 static char buffer[10]; VAL [buffer={3:0}] [L683] 0 static unsigned int first; VAL [buffer={3:0}, first=0] [L684] 0 static unsigned int next; VAL [buffer={3:0}, first=0, next=0] [L685] 0 static int buffer_size; VAL [buffer={3:0}, buffer_size=0, first=0, next=0] [L686] 0 _Bool send, receive; VAL [buffer={3:0}, buffer_size=0, first=0, next=0, receive=0, send=0] [L687] 0 pthread_mutex_t m; VAL [buffer={3:0}, buffer_size=0, first=0, m={4:0}, next=0, receive=0, send=0] [L756] 0 pthread_t id1, id2; VAL [buffer={3:0}, buffer_size=0, first=0, id1={6:0}, id2={5:0}, m={4:0}, next=0, receive=0, send=0] [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] EXPR 0 next = 0 VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] 0 first = next = 0 VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L758] RET 0 initLog(10) [L759] 0 send=1 VAL [buffer={3:0}, buffer_size=10, first=0, id1={6:0}, id2={5:0}, m={4:0}, next=0, receive=0, send=1] [L760] 0 receive=0 VAL [buffer={3:0}, buffer_size=10, first=0, id1={6:0}, id2={5:0}, m={4:0}, next=0, receive=0, send=1] [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1={6:0}, id2={5:0}, m={4:0}, next=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=2, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1={6:0}, id2={5:0}, m={4:0}, next=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=3, receive=0, send=1] [L763] 0 \read(id1) VAL [\read(id1)=2, buffer={3:0}, buffer_size=10, first=0, id1={6:0}, id2={5:0}, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L724] 1 i=0 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=1, send=0] [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] VAL [buffer={3:0}, buffer[first-1]=0, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] 2 return buffer[first-1]; VAL [\result=0, buffer={3:0}, buffer[first-1]=0, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L745] RET, EXPR 2 removeLogElement() [L745] COND TRUE 2 removeLogElement()==i VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=1, removeLogElement()=0, send=0] [L747] 2 receive=0 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=0, send=0] [L748] 2 send=1 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [\old(b)=6, b=6, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=0, send=1] [L709] 1 buffer[next] = b VAL [\old(b)=6, b=6, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=0, send=1] [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=6, b=6, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=2, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=2, receive=1, send=0] [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=2, receive=1, send=0] [L698] EXPR 2 buffer[first-1] VAL [buffer={3:0}, buffer[first-1]=6, buffer_size=10, first=2, m={4:0}, next=2, receive=1, send=0] [L698] 2 return buffer[first-1]; VAL [\result=6, buffer={3:0}, buffer[first-1]=6, buffer_size=10, first=2, m={4:0}, next=2, receive=1, send=0] [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=1, m={4:0}, next=2, receive=1, removeLogElement()=6, send=0] [L746] 2 reach_error() VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=1, m={4:0}, next=2, receive=1, send=0] - UnprovableResult [Line: 761]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 199 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 105.0s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 61.1s, 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: 113, 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.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1400 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2092 ConstructedInterpolants, 140 QuantifiedInterpolants, 13809 SizeOfPredicates, 54 NumberOfNonLiveVariables, 3215 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 1388/1800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-05 00:14:09,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-09-05 00:14:09,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...