./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 21:35:56,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 21:35:56,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 21:35:56,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 21:35:56,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 21:35:56,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 21:35:56,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 21:35:56,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 21:35:56,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 21:35:56,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 21:35:56,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 21:35:56,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 21:35:56,434 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 21:35:56,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 21:35:56,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 21:35:56,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 21:35:56,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 21:35:56,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 21:35:56,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 21:35:56,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 21:35:56,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 21:35:56,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 21:35:56,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 21:35:56,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 21:35:56,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 21:35:56,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 21:35:56,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 21:35:56,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 21:35:56,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 21:35:56,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 21:35:56,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 21:35:56,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 21:35:56,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 21:35:56,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 21:35:56,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 21:35:56,444 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 21:35:56,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 21:35:56,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 21:35:56,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 21:35:56,444 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 21:35:56,444 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 21:35:56,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-09-08 21:35:56,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 21:35:56,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 21:35:56,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 21:35:56,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 21:35:56,664 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 21:35:56,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-09-08 21:35:57,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 21:35:58,148 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 21:35:58,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-09-08 21:35:58,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9c152eb18/53056ba7931948dd8210fa4d5ab09b32/FLAG0bacc673f [2024-09-08 21:35:58,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9c152eb18/53056ba7931948dd8210fa4d5ab09b32 [2024-09-08 21:35:58,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 21:35:58,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-08 21:35:58,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 21:35:58,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 21:35:58,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 21:35:58,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb9bdd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58, skipping insertion in model container [2024-09-08 21:35:58,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 21:35:58,536 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[186287,186300] [2024-09-08 21:35:58,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 21:35:58,582 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 21:35:58,627 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[186287,186300] [2024-09-08 21:35:58,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 21:35:58,690 INFO L204 MainTranslator]: Completed translation [2024-09-08 21:35:58,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58 WrapperNode [2024-09-08 21:35:58,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 21:35:58,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 21:35:58,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 21:35:58,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 21:35:58,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,745 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2024-09-08 21:35:58,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 21:35:58,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 21:35:58,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 21:35:58,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 21:35:58,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 21:35:58,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 21:35:58,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 21:35:58,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 21:35:58,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (1/1) ... [2024-09-08 21:35:58,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 21:35:58,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:35:58,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 21:35:58,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 21:35:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-09-08 21:35:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-09-08 21:35:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 21:35:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 21:35:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 21:35:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 21:35:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-08 21:35:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-08 21:35:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 21:35:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-09-08 21:35:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 21:35:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 21:35:58,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 21:35:58,869 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 21:35:59,092 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 21:35:59,094 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 21:35:59,261 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 21:35:59,261 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 21:35:59,363 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 21:35:59,363 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-08 21:35:59,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:35:59 BoogieIcfgContainer [2024-09-08 21:35:59,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 21:35:59,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 21:35:59,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 21:35:59,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 21:35:59,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:35:58" (1/3) ... [2024-09-08 21:35:59,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf619df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:35:59, skipping insertion in model container [2024-09-08 21:35:59,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:35:58" (2/3) ... [2024-09-08 21:35:59,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf619df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:35:59, skipping insertion in model container [2024-09-08 21:35:59,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:35:59" (3/3) ... [2024-09-08 21:35:59,369 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-09-08 21:35:59,380 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 21:35:59,381 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-08 21:35:59,381 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 21:35:59,416 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-09-08 21:35:59,457 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 21:35:59,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 21:35:59,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:35:59,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 21:35:59,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 21:35:59,487 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 21:35:59,499 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 21:35:59,505 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c991a6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 21:35:59,505 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-08 21:35:59,523 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:35:59,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:35:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1544696618, now seen corresponding path program 1 times [2024-09-08 21:35:59,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:35:59,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330481090] [2024-09-08 21:35:59,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:35:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:35:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:36:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 21:36:00,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:36:00,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330481090] [2024-09-08 21:36:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330481090] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:36:00,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:36:00,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 21:36:00,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008390172] [2024-09-08 21:36:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:36:00,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 21:36:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:36:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 21:36:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 21:36:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:00,041 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:36:00,042 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:36:00,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:00,071 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 21:36:00,072 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:36:00,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:36:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1605291128, now seen corresponding path program 1 times [2024-09-08 21:36:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:36:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137651998] [2024-09-08 21:36:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:36:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:36:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:36:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 21:36:00,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:36:00,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137651998] [2024-09-08 21:36:00,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137651998] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:36:00,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:36:00,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 21:36:00,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89442970] [2024-09-08 21:36:00,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:36:00,192 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 21:36:00,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:36:00,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 21:36:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 21:36:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:00,193 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:36:00,193 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:36:00,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:00,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:06,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 21:36:06,068 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:36:06,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:36:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1704738767, now seen corresponding path program 1 times [2024-09-08 21:36:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:36:06,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975188532] [2024-09-08 21:36:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:36:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:36:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:36:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 21:36:06,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:36:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975188532] [2024-09-08 21:36:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975188532] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:36:06,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:36:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-08 21:36:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756305818] [2024-09-08 21:36:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:36:06,759 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 21:36:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:36:06,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 21:36:06,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-08 21:36:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:06,760 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:36:06,761 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:36:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:07,053 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 21:36:07,053 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:36:07,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:36:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1871358620, now seen corresponding path program 1 times [2024-09-08 21:36:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:36:07,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261370590] [2024-09-08 21:36:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:36:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:36:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:36:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 21:36:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:36:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261370590] [2024-09-08 21:36:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261370590] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:36:08,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:36:08,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-08 21:36:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127230318] [2024-09-08 21:36:08,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:36:08,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 21:36:08,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:36:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 21:36:08,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-09-08 21:36:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:08,286 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:36:08,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:36:08,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:08,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:08,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:08,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-08 21:36:10,309 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 21:36:10,309 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:36:10,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:36:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 675323422, now seen corresponding path program 1 times [2024-09-08 21:36:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:36:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338235686] [2024-09-08 21:36:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:36:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:36:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:36:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 21:36:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:36:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338235686] [2024-09-08 21:36:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338235686] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:36:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:36:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 21:36:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516335276] [2024-09-08 21:36:10,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:36:10,368 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 21:36:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:36:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 21:36:10,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 21:36:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:10,368 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:36:10,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:36:10,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:10,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:10,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:10,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-09-08 21:36:10,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 21:36:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 21:36:19,052 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 21:36:19,053 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:36:19,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:36:19,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1164823947, now seen corresponding path program 2 times [2024-09-08 21:36:19,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:36:19,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131846444] [2024-09-08 21:36:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:36:19,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:36:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:36:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 21:36:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:36:19,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131846444] [2024-09-08 21:36:19,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131846444] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:36:19,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:36:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-08 21:36:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405714100] [2024-09-08 21:36:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:36:19,544 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-08 21:36:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:36:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-08 21:36:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-09-08 21:36:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:19,546 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:36:19,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:36:19,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:19,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:19,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:19,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 21:36:19,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 21:36:19,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 21:36:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 21:36:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 21:36:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:29,778 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 21:36:29,778 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:36:29,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:36:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash 916557327, now seen corresponding path program 3 times [2024-09-08 21:36:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:36:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932772078] [2024-09-08 21:36:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:36:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:36:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:36:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 21:36:30,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:36:30,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932772078] [2024-09-08 21:36:30,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932772078] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:36:30,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:36:30,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-08 21:36:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290052469] [2024-09-08 21:36:30,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:36:30,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 21:36:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:36:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 21:36:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-08 21:36:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:30,406 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:36:30,406 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:36:30,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:30,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:30,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 21:36:30,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 21:36:30,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 21:36:30,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:30,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:36:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:36:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:36:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 21:36:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 21:36:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 21:36:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:36:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 21:36:34,190 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 21:36:34,190 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-09-08 21:36:34,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:36:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 343352258, now seen corresponding path program 2 times [2024-09-08 21:36:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:36:34,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238886232] [2024-09-08 21:36:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:36:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:36:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 21:36:34,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 21:36:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 21:36:34,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 21:36:34,281 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 21:36:34,282 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-08 21:36:34,284 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-09-08 21:36:34,284 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-09-08 21:36:34,284 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-09-08 21:36:34,285 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-08 21:36:34,285 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-08 21:36:34,285 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 21:36:34,290 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-09-08 21:36:34,339 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 21:36:34,340 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 21:36:34,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 09:36:34 BasicIcfg [2024-09-08 21:36:34,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 21:36:34,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-08 21:36:34,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-08 21:36:34,345 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-08 21:36:34,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:35:59" (3/4) ... [2024-09-08 21:36:34,346 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-09-08 21:36:34,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-09-08 21:36:34,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-08 21:36:34,403 INFO L158 Benchmark]: Toolchain (without parser) took 36201.27ms. Allocated memory was 207.6MB in the beginning and 260.0MB in the end (delta: 52.4MB). Free memory was 176.9MB in the beginning and 109.8MB in the end (delta: 67.2MB). Peak memory consumption was 119.4MB. Max. memory is 16.1GB. [2024-09-08 21:36:34,404 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 21:36:34,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.52ms. Allocated memory is still 207.6MB. Free memory was 176.9MB in the beginning and 141.0MB in the end (delta: 35.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-09-08 21:36:34,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.63ms. Allocated memory is still 207.6MB. Free memory was 141.0MB in the beginning and 138.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-08 21:36:34,404 INFO L158 Benchmark]: Boogie Preprocessor took 42.87ms. Allocated memory is still 207.6MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 21:36:34,404 INFO L158 Benchmark]: RCFGBuilder took 573.90ms. Allocated memory is still 207.6MB. Free memory was 136.0MB in the beginning and 163.8MB in the end (delta: -27.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-09-08 21:36:34,405 INFO L158 Benchmark]: TraceAbstraction took 34978.98ms. Allocated memory was 207.6MB in the beginning and 260.0MB in the end (delta: 52.4MB). Free memory was 163.8MB in the beginning and 118.1MB in the end (delta: 45.6MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-09-08 21:36:34,405 INFO L158 Benchmark]: Witness Printer took 58.86ms. Allocated memory is still 260.0MB. Free memory was 118.1MB in the beginning and 109.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-08 21:36:34,406 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.16ms. Allocated memory is still 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.52ms. Allocated memory is still 207.6MB. Free memory was 176.9MB in the beginning and 141.0MB in the end (delta: 35.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.63ms. Allocated memory is still 207.6MB. Free memory was 141.0MB in the beginning and 138.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.87ms. Allocated memory is still 207.6MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.90ms. Allocated memory is still 207.6MB. Free memory was 136.0MB in the beginning and 163.8MB in the end (delta: -27.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34978.98ms. Allocated memory was 207.6MB in the beginning and 260.0MB in the end (delta: 52.4MB). Free memory was 163.8MB in the beginning and 118.1MB in the end (delta: 45.6MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. * Witness Printer took 58.86ms. Allocated memory is still 260.0MB. Free memory was 118.1MB in the beginning and 109.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 666, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 107, dependent conditional: 94, dependent unconditional: 13, unknown: 21, unknown conditional: 6, unknown unconditional: 15] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 574, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 21, unknown conditional: 6, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 574, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 21, unknown conditional: 6, unknown unconditional: 15] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 613, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 29, dependent conditional: 16, dependent unconditional: 13, unknown: 46, unknown conditional: 31, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 613, independent: 538, independent conditional: 8, independent unconditional: 530, dependent: 29, dependent conditional: 10, dependent unconditional: 19, unknown: 46, unknown conditional: 18, unknown unconditional: 28] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 613, independent: 538, independent conditional: 8, independent unconditional: 530, dependent: 29, dependent conditional: 10, dependent unconditional: 19, unknown: 46, unknown conditional: 18, unknown unconditional: 28] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, independent: 313, independent conditional: 7, independent unconditional: 306, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 27, unknown conditional: 12, unknown unconditional: 15] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 57, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 27, unknown conditional: 12, unknown unconditional: 15] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 27, unknown conditional: 12, unknown unconditional: 15] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28988, independent: 412, independent conditional: 376, independent unconditional: 36, dependent: 395, dependent conditional: 116, dependent unconditional: 278, unknown: 28181, unknown conditional: 12956, unknown unconditional: 15225] , Protected Queries: 0 ], Cache Queries: [ total: 613, independent: 225, independent conditional: 1, independent unconditional: 224, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 379, unknown conditional: 32, unknown unconditional: 347] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 313, Positive conditional cache size: 7, Positive unconditional cache size: 306, Negative cache size: 20, Negative conditional cache size: 7, Negative unconditional cache size: 13, Unknown cache size: 27, Unknown conditional cache size: 12, Unknown unconditional cache size: 15, Eliminated conditions: 243, Maximal queried relation: 4, Independence queries for same thread: 92, Persistent sets #1 benchmarks: Persistent set computation time: 15.6s, Number of persistent set computation: 107, Number of trivial persistent sets: 102, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 334, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 666, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 107, dependent conditional: 94, dependent unconditional: 13, unknown: 21, unknown conditional: 6, unknown unconditional: 15] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 574, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 21, unknown conditional: 6, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 574, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 21, unknown conditional: 6, unknown unconditional: 15] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 613, independent: 538, independent conditional: 232, independent unconditional: 306, dependent: 29, dependent conditional: 16, dependent unconditional: 13, unknown: 46, unknown conditional: 31, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 613, independent: 538, independent conditional: 8, independent unconditional: 530, dependent: 29, dependent conditional: 10, dependent unconditional: 19, unknown: 46, unknown conditional: 18, unknown unconditional: 28] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 613, independent: 538, independent conditional: 8, independent unconditional: 530, dependent: 29, dependent conditional: 10, dependent unconditional: 19, unknown: 46, unknown conditional: 18, unknown unconditional: 28] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, independent: 313, independent conditional: 7, independent unconditional: 306, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 27, unknown conditional: 12, unknown unconditional: 15] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 57, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 27, unknown conditional: 12, unknown unconditional: 15] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 27, unknown conditional: 12, unknown unconditional: 15] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28988, independent: 412, independent conditional: 376, independent unconditional: 36, dependent: 395, dependent conditional: 116, dependent unconditional: 278, unknown: 28181, unknown conditional: 12956, unknown unconditional: 15225] , Protected Queries: 0 ], Cache Queries: [ total: 613, independent: 225, independent conditional: 1, independent unconditional: 224, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 379, unknown conditional: 32, unknown unconditional: 347] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 313, Positive conditional cache size: 7, Positive unconditional cache size: 306, Negative cache size: 20, Negative conditional cache size: 7, Negative unconditional cache size: 13, Unknown cache size: 27, Unknown conditional cache size: 12, Unknown unconditional cache size: 15, Eliminated conditions: 243, Maximal queried relation: 4, Independence queries for same thread: 92 - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, d={5:24}, data={5:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 2 return 0; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 1 return 0; [L3932] 0 return 0; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result=0, \result={0:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, res=0, t1=-1, t2=0] [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-1, t2=0] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3931]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 52 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 34.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 30.9s, 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: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 1620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-09-08 21:36:34,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-09-08 21:36:34,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE